×

# Number Theory Proof

Let $$n\geqslant 2$$ and $$k$$ be any positive integers. Prove that $$(n-1)^2 | (n^k - 1)$$ if and only if $$(n-1) | k$$.

Note by أحمد الحلاق
7 months, 4 weeks ago

Sort by:

Just use the identity

$$\frac{n^k-1}{n-1}=n^{k-1}+\ldots+n^1+1$$

and take the resulting equation $$\text{mod n}$$ · 7 months, 3 weeks ago

Thank you so much · 7 months, 3 weeks ago

I mean $$\text{mod (n-1)}$$ · 7 months, 3 weeks ago