🔢
Fermat's Little Theorem Calculator
Number Theory & Modular Arithmetic Solver
Number Theory Guidelines: Enter a base integer ($a$) and a prime number ($p$) below to verify Fermat's Little Theorem equations ($a^p \equiv a \pmod{p}$ and $a^{p-1} \equiv 1 \pmod{p}$).
Theorem Parameters
Calculation Results
⚠️ For educational and number theory reference purposes only. Verify critical cryptographic calculations independently.