Number Systemshard
0:00.0

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