/- 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 FormalConjecturesUtil

Erdős Problem 685

References:

    erdosproblems.com/685

    [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 : ℝ) / p

Both ends are excluded: the only prime strictly between $2$ and $5$ is $3$.

⊢ ∑ p ∈ {3}, 1 / ↑p = 1 / 3 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) := ⊢ ∀ ε > 0, ∀ δ > 0, ∀ᶠ (n : ℕ) in atTop, ∀ (k : ℕ), ↑n ^ ε < ↑k → ↑k ≤ ↑n ^ (1 - ε) → |↑(ω (n.choose k)) - ↑k * primeRecipSum k n| ≤ δ * (↑k * primeRecipSum k n) 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) := ⊢ ∃ 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) 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}.$$

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)hlog:Real.log ↑(n.choose k) ≤ Real.log (↑n ^ ω (n.choose k))⊢ Real.log ↑(n.choose k) ≤ ↑(ω (n.choose k)) * Real.log ↑n All goals completed! 🐙end Erdos685