Theorems · Theorem · number theory
ZMod.pow_card
∀ {p : ℕ} [inst : Fact (Nat.Prime p)] (x : ZMod p), x ^ p = xA variation on Fermat's little theorem. See ZMod.pow_card_sub_one_eq_one
- Defined in
- Mathlib.FieldTheory.Finite.Basic
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 100 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fact
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Factstatement and proof · cited by 2,726
- Nat.Primestatement and proof · cited by 2,059
- Fintype.cardproof · cited by 1,386
- ZModstatement and proof · cited by 1,024
- ZMod.cardproof · cited by 36
- FiniteField.pow_cardproof · cited by 8
Cited by5
Results whose statement or proof uses this declaration.
- ZMod.pow_card_powproof · cited by 1
- Int.ModEq.pow_prime_eq_selfproof · cited by 1
- WittVector.frobenius_zmodpproof · cited by 1
- MvPolynomial.frobenius_zmodproof · cited by 1
- ZMod.frobenius_zmodproof · cited by 0