This preview shows page 1. Sign up to view the full content.
Unformatted text preview: a p a (mod p )) by induction on a . 6. Show that 45 is a pseudoprime to the bases 17 and 19. 7. Show that every Carmichael number is squarefree. More precisely, show that if m = p 2 q then m is not a pseudoprime for the base a = pq + 1, and that ( a, m ) = 1. For this: (a) First observe that pq 6 (mod m ), but ( pq ) r (mod m ) for every r > 1. (b) Conclude, using the binomial theorem, that a m 1 (mod m ) . Why does this imply m is not a pseudoprime? (c) Show that ( a, m ) = 1 by nding the inverse of a modulo m . Hint: (1+ pq )(1pq ) = 1( pq ) 2 . 1...
View
Full
Document
This note was uploaded on 04/08/2008 for the course MATH 115A taught by Professor Santos during the Fall '07 term at UC Davis.
 Fall '07
 Santos
 Number Theory, Remainder

Click to edit the document details