Check Primality and Fermat's Condition

Enter values for p and a to test if:

• p is prime (using the AKS primality test).
• If p is prime and not divisible by a, then Fermat's Little Theorem states: a^(p-1) ≡ 1 (mod p).