TI Number Theory (TINT)

TINT, or TI Number Theory, is a package of lists and programs designed for number theoretic computation and analysis on the TI-83+ series of calculators. These programs are designed to be used as subprograms for larger projects, and are optimized for numbers less than 10^14. TINT's main feature is the precomputation of many arithmetic properties of a given input number stored for later use (e.g. number of divisors, totient function, etc.).

Updated in v1.1
Removed all remainder( commands to allow support for older OS's
Added primality/probable prime tests (see documentation for θNTPT)
Added Lucas sequence generation (see documentation for θNTLS)
Added more numerical properties to θNTIS
Adjusted variable allocation for less shuffling (most inputs that are "bases" are now θ instead of Q)
Better edge case support
General bug fixes

Updated in v1.2
Added Zeda's fast moduler exponentian algorithm (see documentation for θNTMZ)