Introduction

I'm very interested in mathematics, and as such, my program archive reflects it. Right now I only have math programs, and, no matter how many people protest, it's going to stay that way. Unfortunately, as you've seen, I don't have many programs listed so far -- that's because there aren't many things that TI-92 can't already do -- when it's not built in, it's probably already covered by ELEM or ADV, two groups of programs released by Soft Warehouse, the designers of many of the 92's symbolic manipulation routines. For more information, see http://www.derive.com/library.htm.

If you have a mathematical program you have pseudocode for, or Pascal code, that you'd like converted to 92-BASIC, drop me a note and attach the code. I'll see what I can do. I'm currently interested in programs in number theory, so if you have a better Pollard-Rho program (mine was adapted from one I found for the 85 a while back), I'd really like to hear about it. Thanks and enjoy!

TI-92 Programs

Number theory

psprime(integer)
Returns true or false depending on whether or not the number is a pseudoprime that passes 2^n =2 (mod n). If it fails the test, the number is composite; if it passes, the number is (probably) prime. The first non-prime to pass is 341.
mprime(integer, number)
If n<3E14 then returns true if the number is prime or false if the number is composite. If n>3E14 then it tests to see if the number is an a-SPRP for all integers a with 1 < a < (largest prime less than or equal to second parameter). The second parameter must not exceed 100 and is disregarded if the first parameter is less than 3E14.
pollard(integer, num2chk)
Attempts to factor a number by Pollard's rho method; checks every 'num2chk' times for a factor (a good num2chk for numbers around 9-10 digits is 10).
modpwr(integer, power, number)
Returns integer^power (mod number).
hprime()
Help/front-end for mprime and psprime.

The group file also contains sumult, a function that returns X*Y (mod N) by pure calculation and primlist, a list of primes used in mprime. Download a zipped copy here and place it in a directory called ntheory.


Return to my TI Calculator Center