Category:Fermat"s Little Theorem
Jump to navigation
Jump to search
This category contains pages concerning Fermat's Little Theorem:
Let $p$ be a prime number.
Let $n \in \Z_{>0}$ be a positive integer such that $p$ is not a divisor of $n$.
Then:
- $n^{p - 1} \equiv 1 \pmod p$
Source of Name
This entry was named for Pierre de Fermat.
Pages in category "Fermat"s Little Theorem"
The following 22 pages are in this category, out of 22 total.
F
- Fermat's Little Theorem
- Fermat's Little Theorem/Also defined as
- Fermat's Little Theorem/Also known as
- Fermat's Little Theorem/Also presented as
- Fermat's Little Theorem/Corollary 1
- Fermat's Little Theorem/Corollary 1/Also known as
- Fermat's Little Theorem/Corollary 1/Also reported as
- Fermat's Little Theorem/Corollary 1/Proof 1
- Fermat's Little Theorem/Corollary 1/Proof 2
- Fermat's Little Theorem/Corollary 2
- Fermat's Little Theorem/Corollary 3
- Fermat's Little Theorem/Corollary 4
- Fermat's Little Theorem/Examples
- Fermat's Little Theorem/Examples/12 Divides n^2-1 if gcd(n, 6)=1
- Fermat's Little Theorem/Examples/5 Divides 8^4-1
- Fermat's Little Theorem/Proof 1
- Fermat's Little Theorem/Proof 2
- Fermat's Little Theorem/Proof 3
- Fermat's Little Theorem/Proof 4
- Fermat's Little Theorem/Proof 5