Prove $p\mid\frac{x^{a}-1}{x-1}$ using Fermat's little theorem Fermat's little theorem states that if $p$ is a prime number, then for any integer $a$, the number $a^{p} − a $ is an integer multiple of $p$. In the notation of modular arithmetic, this is expressed as $a^{p} \equiv a \pmod p.$
Using this theorem prove:
Given a prime number $p$, show that if there are a positive integer $x$ and a prime number $a$ such that  $p$ divides 
$\frac{x^{a}-1}{x-1}$, then either $a = p$ or $p \equiv 1 \pmod a$.
$$p\mid\frac{x^{a}-1}{x-1}$$
So, I'm thinking:
$$\frac{x^{a}-1}{x-1} = x^{a-1}+x^{a-2}+...+1$$ 
I tried the telescoping technique but that doesn't work, assuming $a = p$, shows that $x^{p-1}\equiv 1 \pmod p$.
So, what else can I do?

You have:
$p|\frac{x^a-1}{x-1}\Rightarrow p|(\frac{x^a-1}{x-1})(x-1) \Rightarrow p|x^a-1 \Rightarrow x^a \equiv 1 (\mod p)$
Hence if $m$ is the order of $x$ with respect to $p$, then $m|a \Rightarrow m=1$ or $m=a$, since $a$ is prime.
If $m=1$, then by the definition of the order, we have that
$x\equiv 1(\mod p)$ and so by the hypothesis we get:
$0\equiv \frac{x^a-1}{x-1}\equiv x^{(a-1)}+...+1\equiv 1^{(a-1)}+...+1\equiv a(\mod p)$
Hence in this case $p|a \Rightarrow p=1\  \text{or}\  p=a$, since $a$ is a prime. The first equality is rejected, because $p>1$ as a prime number.
If $m=a$, then $a|p-1 \Rightarrow p\equiv 1 (\mod a)$, because it is known that for the order $m$ we have $m|φ(p)$. $φ$ is the Euler totient function.
The proof of the property that $m$ holds uses the Fermat's little Theorem.
Links:
1.Orders
2.Euler's Totient Function
