Processing math: 83%


EulerFermatTheorem Intermediate

Problem - 4171

Let p and q be two distinct primes, and integer a is co-prime to both p and q, show a^{(p-1)(q-1)}\equiv 1\pmod{pq}


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