/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilErdős Problem 685
References:
[Er79d] Erdős, P., Some unconventional problems in number theory. Acta Math. Acad. Sci. Hungar. (1979), 71-80.
@[expose] public sectionopen Filteropen scoped ArithmeticFunction.omeganamespace Erdos685
primeRecipSum k n is the sum of $1/p$ over the primes $k < p < n$.
noncomputable def primeRecipSum (k n : ℕ) : ℝ :=
∑ p ∈ (Finset.Ioo k n).filter Nat.Prime, (1 : ℝ) / pBoth ends are excluded: the only prime strictly between $2$ and $5$ is $3$.
⊢ ∑ p ∈ {3}, 1 / ↑p = 1 / 3
norm_num All goals completed! 🐙Let $\epsilon > 0$ and let $n$ be large depending on $\epsilon$. Is it true that for all $n^{\epsilon} < k \leq n^{1-\epsilon}$ the number of distinct prime divisors of $\binom{n}{k}$ is $$(1+o(1)), k \sum_{k < p < n} \frac{1}{p}?$$
The $o(1)$ is uniform in $k$.
@[category research open, question, AMS 11]
theorem erdos_685.parts.i :
∀ ε > (0 : ℝ), ∀ δ > (0 : ℝ), ∀ᶠ n : ℕ in atTop, ∀ k : ℕ,
(n : ℝ) ^ ε < (k : ℝ) → (k : ℝ) ≤ (n : ℝ) ^ (1 - ε) →
|(ω (n.choose k) : ℝ) - (k : ℝ) * primeRecipSum k n| ≤
δ * ((k : ℝ) * primeRecipSum k n) := by ⊢ ∀ ε > 0,
∀ δ > 0,
∀ᶠ (n : ℕ) in atTop,
∀ (k : ℕ),
↑n ^ ε < ↑k → ↑k ≤ ↑n ^ (1 - ε) → |↑(ω (n.choose k)) - ↑k * primeRecipSum k n| ≤ δ * (↑k * primeRecipSum k n)
sorry All goals completed! 🐙Is it true that, for some constant $c > 0$, the number of distinct prime divisors of $\binom{n}{k}$ is $$(1+o(1)), k \sum_{k < p < n} \frac{1}{p}$$ even for all $(\log n)^c \leq k \leq n^{1-\epsilon}$?
Here $\epsilon > 0$ is as in the first question, and the $o(1)$ is uniform in $k$.
@[category research open, question, AMS 11]
theorem erdos_685.parts.ii :
∃ c > (0 : ℝ), ∀ ε > (0 : ℝ), ∀ δ > (0 : ℝ), ∀ᶠ n : ℕ in atTop, ∀ k : ℕ,
Real.log (n : ℝ) ^ c ≤ (k : ℝ) → (k : ℝ) ≤ (n : ℝ) ^ (1 - ε) →
|(ω (n.choose k) : ℝ) - (k : ℝ) * primeRecipSum k n| ≤
δ * ((k : ℝ) * primeRecipSum k n) := by ⊢ ∃ c > 0,
∀ ε > 0,
∀ δ > 0,
∀ᶠ (n : ℕ) in atTop,
∀ (k : ℕ),
Real.log ↑n ^ c ≤ ↑k →
↑k ≤ ↑n ^ (1 - ε) → |↑(ω (n.choose k)) - ↑k * primeRecipSum k n| ≤ δ * (↑k * primeRecipSum k n)
sorry All goals completed! 🐙For $1 \leq k \leq n - 1$ the number of distinct prime divisors of $\binom{n}{k}$ satisfies $$\omega\left(\binom{n}{k}\right) \geq \frac{\log \binom{n}{k}}{\log n}.$$
@[category textbook, AMS 11]
theorem erdos_685.variants.trivial_lower_bound :
∀ n k : ℕ, 0 < k → k < n →
Real.log (n.choose k : ℝ) / Real.log (n : ℝ) ≤ (ω (n.choose k) : ℝ) := by ⊢ ∀ (n k : ℕ), 0 < k → k < n → Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k))
intro n k hk0 hkn n:ℕk:ℕhk0:0 < khkn:k < n⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k))
have hn : 1 < n := by ⊢ ∀ (n k : ℕ), 0 < k → k < n → Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < n⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) omega n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < n⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < n⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k))
have hchoose : n.choose k ≤ n ^ (ω (n.choose k)) := by ⊢ ∀ (n k : ℕ), 0 < k → k < n → Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k))
have hc : (n.choose k).primeFactors.card = ω (n.choose k) := by ⊢ ∀ (n k : ℕ), 0 < k → k < n → Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhc:(n.choose k).primeFactors.card = ω (n.choose k)⊢ n.choose k ≤ n ^ ω (n.choose k) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k))
simp only [Nat.primeFactors, List.card_toFinset, ArithmeticFunction.cardDistinctFactors_apply] n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhc:(n.choose k).primeFactors.card = ω (n.choose k)⊢ n.choose k ≤ n ^ ω (n.choose k) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhc:(n.choose k).primeFactors.card = ω (n.choose k)⊢ n.choose k ≤ n ^ ω (n.choose k) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k))
calc
n.choose k = ∏ p ∈ (n.choose k).primeFactors,
p ^ (n.choose k).factorization p :=
Nat.prod_primeFactors_pow_factorization (Nat.choose_ne_zero hkn.le)
_ ≤ ∏ _p ∈ (n.choose k).primeFactors, n :=
Finset.prod_le_prod' fun _ _ => Nat.pow_factorization_choose_le (by n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhc:(n.choose k).primeFactors.card = ω (n.choose k)x✝¹:ℕx✝:x✝¹ ∈ (n.choose k).primeFactors⊢ 0 < n n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) omega All goals completed! 🐙 n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)))
_ = n ^ (ω (n.choose k)) := by n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhc:(n.choose k).primeFactors.card = ω (n.choose k)⊢ ∏ _p ∈ (n.choose k).primeFactors, n = n ^ ω (n.choose k) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) simp [hc] n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k))
have hp : 0 < Real.log (n : ℝ) := Real.log_pos (by n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)⊢ 1 < ↑n n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)hp:0 < Real.log ↑n⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) exact_mod_cast hn All goals completed! 🐙 n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)hp:0 < Real.log ↑n⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k))) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)hp:0 < Real.log ↑n⊢ Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k))
apply (div_le_iff₀ hp).mpr n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)hp:0 < Real.log ↑n⊢ Real.log ↑(n.choose k) ≤ ↑(ω (n.choose k)) * Real.log ↑n
have hpow : (n.choose k : ℝ) ≤ (n : ℝ) ^ (ω (n.choose k)) := by ⊢ ∀ (n k : ℕ), 0 < k → k < n → Real.log ↑(n.choose k) / Real.log ↑n ≤ ↑(ω (n.choose k)) n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)hp:0 < Real.log ↑nhpow:↑(n.choose k) ≤ ↑n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) ≤ ↑(ω (n.choose k)) * Real.log ↑n
exact_mod_cast hchoose n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)hp:0 < Real.log ↑nhpow:↑(n.choose k) ≤ ↑n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) ≤ ↑(ω (n.choose k)) * Real.log ↑n n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)hp:0 < Real.log ↑nhpow:↑(n.choose k) ≤ ↑n ^ ω (n.choose k)⊢ Real.log ↑(n.choose k) ≤ ↑(ω (n.choose k)) * Real.log ↑n
have hlog := Real.log_le_log (Nat.cast_pos.mpr (Nat.choose_pos hkn.le)) hpow n:ℕk:ℕhk0:0 < khkn:k < nhn:1 < nhchoose:n.choose k ≤ n ^ ω (n.choose k)hp:0 < Real.log ↑nhpow:↑(n.choose k) ≤ ↑n ^ ω (n.choose k)hlog:Real.log ↑(n.choose k) ≤ Real.log (↑n ^ ω (n.choose k))⊢ Real.log ↑(n.choose k) ≤ ↑(ω (n.choose k)) * Real.log ↑n
simpa only [Real.log_pow] using hlog All goals completed! 🐙end Erdos685