HP Forums

hi,
please help with some hint to write a little program to calculate Carmichael numbers, using the built in functions of Prime...
(see here for a tool on line) - \( b^{n-1} \equiv 1 \mod n \):

1. calculate a list of Carmichael n. less than a given n
2. test if a number is a C.n.

There is already a program for Prime for this purpose?

Thank you
Salvo

No, because it is not used except as exercice.
powmod will help you.

(02-12-2015 03:41 PM)parisse Wrote: [ -> ]No, because it is not used except as exercice.
powmod will help you.

ok, thank you, I try with powmod...