TI-83 lacks a few things helpful for Number Theory, so I added them in during a free today, thought they may be helpful to others:
prgmMODULUS
Used to find even divisibility (VERY HELPFUL!). This is a requirement for other programs below.
:If F:Then
:E/F->G
:F*(G-int(G))->G
:If G<0:G+F->G
:Else
:0->G
:End
Result: 0 F divides E evenly (ie: F = 2, E = 10).
remainder otherwise.
prgmSUMFACTS
Sums all factors (divisors) of a given number, 1 and the number inclusive. Useful in finding k-perfect numbers.
:Input "NUM=",A
:0->K
:For(I,1,A+1)
:A->E
:I->F
:prgmMODULUS
:If G=0
:K+I->K
:End
:Disp K
prgmFACTOR
Displays all factors of a number, 1 and number exclusive
:Input "NUM=",A
:0->K
:For(I,1,A+1)
:A->E
:I->F
:prgmMODULUS
:If G=0
:Disp I
:End
prgmPF
Launcher for prgmPRMEFACT
:ClrHome
:Input "NUM=",A
:prgmPRMEFACT
prgmPRMEFACT
Displays the prime factorization (kind of) of a number
:2->I
:While I<A
:A->E
:I->F
:prgmMODULUS
:If G=0:Then
:Disp I
:A/I->A
:Else
:I+1->I
:End
:End
:Disp A