AFTD Auto-Formalizing Theoretical Domains

bh_dense_prime

def

The prime used for the next block of the construction: a prime larger than both h and h*n, chosen arbitrarily (Classical.choose) from the infinitude of primes.

Statement

noncomputable def bh_dense_prime (h n : ℕ) : ℕ
Source
step towards infinite_bh_set_upper_density_eq_one_div_h
Verified
05 Nov 2026
Axioms
none listed
Used by 1
  • bh_dense_stageThe k-th stage of the construction (paper (3.2)): S_0 = {1} and S_{k+1} = S_k ∪ (M_k + B_q), where q = q_k is a prime exceeding…

Lean source view module on GitHub

/-- A prime exceeding `max h (h*n)`. -/
noncomputable def bh_dense_prime (h n : ℕ) : ℕ := Classical.choose (Nat.exists_infinite_primes (max h (h * n) + 1))
See it in the graphDiscuss this resultChallenge it