Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Number Systemshard
0:00.0

In base ppp arithmetic, Fermat's little theorem states that for prime ppp and integer aaa with gcd⁡(a,p)=1\gcd(a,p)=1gcd(a,p)=1: