Euler gone wild!

\[\large a^{11762}\equiv{a^2}\pmod{25725}\]

Find the smallest positive integer \(a\) such that the congruency above fails to hold.

×

Problem Loading...

Note Loading...

Set Loading...