May 2016
Intermediate to advanced
354 pages
10h 38m
English

If s is even, then 2k+1 | n−1and
mod n. Otherwise, if s is odd, then 2k+1 ∤ n−1 and
mod n. Euler’s criterion and Zolotarev’s lemma yield

Thus,
We conclude mod n, as desired.
□
The proof of Theorem 3.12 is adapted from Carl Bernard Pomerance (born ...
Read now
Unlock full access