MATH 319 SPRING 2002

Number Theory Calculator

The routines are written in JavaScript, which seems to handle integer arithmetic up to well over a hundred digits.


GCD Calculator
This runs the Euclidean Algorithm

a=
b=
(a,b)=
= x
+ x


PowerMod Calculator
Computes (base)(exponent) mod (modulus) in log(exponent) time.

Base: Exponent: Modulus:
be mod (m) =


Multiplication and Power Table Generator
Displays multiplication tables and power tables for the invertible elements in Z/mZ*.

Modulus: