Post Reply 
Carmichael numbers?
02-12-2015, 03:07 PM (This post was last modified: 02-12-2015 03:07 PM by salvomic.)
Post: #1
Carmichael numbers?
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

∫aL√0mic (IT9CLU), HP Prime 50g 41CX 71b 42s 12C 15C - DM42 WP34s :: Prime Soft. Lib
Visit this user's website Find all posts by this user
Quote this message in a reply
02-12-2015, 03:41 PM
Post: #2
RE: Carmichael numbers?
No, because it is not used except as exercice.
powmod will help you.
Find all posts by this user
Quote this message in a reply
02-12-2015, 04:37 PM
Post: #3
RE: Carmichael numbers?
(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...

∫aL√0mic (IT9CLU), HP Prime 50g 41CX 71b 42s 12C 15C - DM42 WP34s :: Prime Soft. Lib
Visit this user's website Find all posts by this user
Quote this message in a reply
Post Reply 




User(s) browsing this thread: 1 Guest(s)