EulerFermatTheorem Difficult

Problem - 3795

Let $x$ be an integer and $p$ is a prime divisor of $(x^6 + x^5 + \cdots + 1)$. Show that $p=7$ or $p\equiv 1\pmod{7}$.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error