Is it true that

1.if p is prime then n^(p squared)=n mod p for all natural numbers n??

2. n^7=n mod 35 for all natural numbers n

If so then what working should i show?and if not then what would be a counter-example??thanksss~~~

Printable View

- April 25th 2011, 10:21 AMbryan06Mod and primes?!
Is it true that

1.if p is prime then n^(p squared)=n mod p for all natural numbers n??

2. n^7=n mod 35 for all natural numbers n

If so then what working should i show?and if not then what would be a counter-example??thanksss~~~ - April 25th 2011, 10:42 AMtopsquark
- April 25th 2011, 10:47 AMtopsquark
This one is true by a version of Fermat's Little Theorem. We can state that

http://latex.codecogs.com/png.latex?...t{(mod p - 1)}

since p^2 - 1 is divisible by p - 1. So by Fermat's Little

http://latex.codecogs.com/png.latex?...\text{(mod p)}

-Dan - April 26th 2011, 12:27 PMbryan06
thankss~~still a bit confused though i researched on wikipedia what fermat little theorem is but still cant figure out how you derived the following:also how do you get from this line to this line

thankss - April 26th 2011, 05:27 PMDrexel28
Or just note that http://latex.codecogs.com/png.latex?...n\text{ mod }p