Question

state Euler Theorem​

Answer 1

${\huge\fbox \pink{A} \fbox \blue{n}\fbox\red{s} \fbox \orange{w} \fbox \green{e} \fbox \purple{R}}$

Euler's Theorem states that if gcd(a,n) = 1, then aφ(n) ≡ 1 (mod n). Here φ(n) is Euler's totient function: the number of integers in {1, 2, . . ., n-1} which are relatively prime to n. When n is a prime, this theorem is just Fermat's little theorem.