1Oh yes .
it was easy :P
thank you anyways :-)
If p is prime ,and x is prime to p,show that xpr-pr-1-1 is divisible by pr
-
UP 0 DOWN 0 0 2
2 Answers
11Obvious for r=1, so let r=2+b, where b≥0
From Fermat's Little Theorem, we have
xp-1≡1(modp), where p is a prime....
Raise both sides to the power p1+b
The result follows.