Cryptography20785 marksNumerical: Fermat's little theoremNumber Theory
Find the value of 72019 mod 13 using Fermat's Little theorem. Define Euler totient function with an example.
Find the value of $7^{2019} \mod 13$ using Fermat's Little theorem. Define Euler totient function with an example. [5]
- Expression to evaluate: $7^{2019} \bmod 13$ - Base $a = 7$, modulus $p = 13$ (prime), exponent $= 2019$ - Task: define Euler totient function with an example --- Fermat's Little Theorem: If $p$ is prime and $\gcd(a,p)=1$, then $$a^{p-1} \equiv 1 \pmod{p}$$ Step 1: Check condition: $13$ is prime...