- #1

lilcoley23@ho

- 19

- 0

Fermats little theorem says a

^{ p-1}≡ 1(mod p) or a

^{p}≡ a(mod p). Now I'm pretty sure that using the permutation from above plugging in for Fermat'l Little Theorem looks like: 52 ≡ 2(mod 2n+1)

If that is right I'm not sure how to show that I came up with that 52.

Can somebody please help?

Thanks you so much! Nicole