nat_least_prime_not_dvd
def
q(m): the smallest prime number not dividing m (0 by convention for m = 0, which no prime fails to divide).
Statement
noncomputable def nat_least_prime_not_dvd (m : ℕ) : ℕ
- Defined in
- arXiv:2610.16562 (The Davenport constant of low-dimensional boxes), Sec. 2 (q(m)).
- Verified
- 14 Oct 2026
- Axioms
- none listed
- Used by 3
- nat_least_prime_not_dvd_twoThe smallest prime not dividing 2 is 3.
- davenport_constant_int_box_two_geFor every m ≥ 2, the Davenport constant of the box ⟦−m, m⟧² is at least 4m² − q(m), q(m) the smallest prime not dividing m: S(m) is a…
- davenport_box_extremal_sequenceThe sequence S(m): q(m)(m−1)+m copies of (m, m), 2m² − m·q(m) copies of (−m, m−1), and 2m² − m copies of (m − q(m), −m).
Lean source view module on GitHub
/-- `q(m)`: the smallest prime not dividing `m`. -/ noncomputable def nat_least_prime_not_dvd (m : ℕ) : ℕ := sInf {p | p.Prime ∧ ¬ p ∣ m}