- #1
smithna1
- 2
- 0
Homework Statement
N is a Carmichael number. It is known that N is square free, show tha tif p is prim and p|N, the (p-1)|(N-1).
Homework Equations
a^N ≡ a (mod N)
The Attempt at a Solution
I want to know if this is good enough or if there is a cleaner way to state it. Thanks!
Let a be a genrator of Z*p, so a has order (p-1). Now (p|N)|a(a^(N-1)-1) but not p|a, so a^(N-1)=1 mod p, hence (N-1) must be divisible by (p-1), the order of a mod p. QED