This section contains source code for the TI-89 calculator. There is currently only one program available, but expect more on the way! If you encounter any problems or errors in the code, please contact me and provide a detailed description of the problem and steps on how to duplicate it. Thanks. |
This is my first TI-89 program. It counts the number of prime numbers below or equal to the given number by brute force. There are much better algorithms, but this is my first TI-89 program so please don't criticize me too harshly! |
This program tests Mersenne numbers up to 21,013-1 for primality. This is pretty useless when compared to GIMPS, but you can use this program to learn how the Lucas-Lehmer algorithm works. |