Title:		Modular Math
Author: 	Mark DeVirgilio
Date:		7 Jan 01
Type: 		Math program to do modular division and modular inverses.
Platform:	TI 83 Plus

MOD finds the remainder of N divided by M.  A simple TI BASIC program.
MODINV finds the mouldar inverse of N which is defined as (N * Ninv) mod M = 1.
For example, run MODINV, put in 19 for N and 26 for M.  The answer is, Ninv = 11.  You can confirm this by 19 * 11 mod 26 = 1.  This program is handy for mini-RSA encryption exercises found in cryptography lessons.  This program uses an extended Euclid method for finding the modular inverse.