EulerFermatTheorem Challenging

Problem - 4239

Let $p$ be an odd prime, and $n=\frac{2^{2p}-1}{3}$ in an integer. Prove $2^{n-1}\equiv 1\pmod{n}$.


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