Theorems · Theorem · number theory
Nat.exists_infinite_pseudoprimes
∀ {b : ℕ}, 1 ≤ b → ∀ (m : ℕ), ∃ n, n.FermatPsp b ∧ m ≤ nFor all positive bases, there exist infinitely many Fermat pseudoprimes to that base.
Given in this form: for all numbers b ≥ 1 and m, there exists a pseudoprime n to base b such
that m ≤ n. This form is similar to Nat.exists_infinite_primes.
- Defined in
- Mathlib.NumberTheory.FermatPsp
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 102 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Nat.Primeproof · cited by 2,059
- le_of_ltproof · cited by 1,175
- le_transproof · cited by 985
- lt_of_lt_of_leproof · cited by 438
- lt_of_le_of_ltproof · cited by 432
- mul_posproof · cited by 374
- tsub_pos_of_ltproof · cited by 31
- pow_le_pow_left'proof · cited by 25
- pos_of_gtproof · cited by 24
- Nat.exists_infinite_primesproof · cited by 7
- Nat.FermatPspstatement and proof · cited by 6
- Nat.not_prime_mulproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Nat.frequently_atTop_fermatPspproof · cited by 1