TI programs that that do modular exponentiation.

See below for a TI-92 version.

TI-82/83 version

Given integer values A, E, and M, this program computes A ^E mod M

: Prompt A

: Prompt E

: Prompt M

: 1->T

: While E >0

: If fPart(E/2)>0

: Then

: T*A-int(T*A/M)*M->T

: End

: A ² -iPart(A ² /M)*M->A

: iPart(E/2)->E

: End

: T

---

TI-92 version

The following TI-92 program was written by Anthony Haroules

powermod()
Prgm
Prompt a
Prompt e
Prompt m
1->t
While e>0
If fPart(e/2)>0 Then
t*a-iPart(t*a/m)*m->t
EndIf
a^2-iPart(a^2/m)*m->a
iPart(e/2)->e
EndWhile
Disp t
EndPrgm

Back to the Number Theory Resources Page