Theorems · Definition · number theory
Nat.FermatPsp
ℕ → ℕ → Prop
n is a Fermat pseudoprime to base b if n is a probable prime to base b and is composite. By
this definition, all composite natural numbers are pseudoprimes to base 0 and 1. This definition
also permits n to be less than b, so that 4 is a pseudoprime to base 5, for example.
- Defined in
- Mathlib.NumberTheory.FermatPsp
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Nat.Primeproof · cited by 2,059
- Nat.ProbablePrimeproof · cited by 3
Cited by6
Results whose statement or proof uses this declaration.
- Nat.exists_infinite_pseudoprimesstatement and proof · cited by 1
- Nat.infinite_setOfPred_pseudoprimesstatement · cited by 1
- Nat.frequently_atTop_fermatPspstatement and proof · cited by 1
- Nat.fermatPsp_base_onestatement · cited by 1
- Nat.infinite_setOf_pseudoprimesstatement · cited by 0
- Nat.coprime_of_fermatPspstatement and proof · cited by 0