Do you want to work with modular arithmetic and prime numbers? Enter your values, and our Advanced Fermat’s Little Theorem Calculator will help you find results based on Fermat’s Little Theorem.
Fermat’s Little Theorem Calculator
Calculate and verify Fermat’s Little Theorem with step-by-step explanations
If p is prime and a is not divisible by p, then:
ap-1 ≡ 1 (mod p)
ap-1 mod p
–
Theorem Verification
–
Multiplicative Inverse
–
Step-by-Step Calculation
Fermat’s Little Theorem Calculator
| Component | Description |
|---|---|
| Base Number (a) | The base number in the theorem, an integer greater than 0. |
| Prime Number (p) | A prime number greater than 0. |
| Result | The result of \(a^{p-1} \mod p\), which should be congruent to 1 according to Fermat’s Little Theorem. |
| Formula | a^(p-1) ≡ 1 (mod p) |
| Purpose | Used to apply Fermat’s Little Theorem in modular arithmetic, aiding in number theory and cryptographic calculations. |