Ed Aboud
- 200
- 0
Homework Statement
Let p be a prime and let a be an integer not divisible by p satisfying a \not \equiv 1 mod p
Show that <br /> 1 + a + a^2 + a^3 + ... + a^p^-^2 \equiv 0 mod p <br />
Homework Equations
The Attempt at a Solution
a^\phi^(^p^) = a^p^-^1 \equiv 1 mod p
a^p^-^1 -1 \equiv 0 mod p
(a^p^-^1 -1)^p \equiv 0 mod p
From a previous theorem that we did in class we showed that p | p\choose m
a^p^(^p^-^1^) - a^p^-^1^(^p^-^1^) + ... <br /> - a^(^p^-^1^) \equiv 0 mod p
I'm stuck here. I think I can sense that I am on the right track but I don't know which direction to go from here.
Any help would be greatly appreciated!
Last edited: