This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ing, or asking PARI via “isprime”) why you think it is probably prime. • Write a PARI program which tests for Carmichael numbers – those numbers N for which: a N1 ≡ 1 (mod N ) for all a with gcd( a, N ) = 1 and ﬁnd at least 3 of them....
View
Full
Document
This note was uploaded on 04/28/2009 for the course MATH 18.781 taught by Professor Brubaker during the Spring '09 term at MIT.
 Spring '09
 BRUBAKER
 Number Theory

Click to edit the document details