/-
Copyright 2025 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 306
References:
[Li26] S. Li, Unit fractions with semiprime denominators: an elementary proof of Erdős Problem 306. arXiv:2609.32140 (2026).
[Ta26] Tang, Yuren, A Lean 4 formalisation of Erdős Problem 306, a proof modulo two Rosser–Schoenfeld axioms.
@[expose] public sectionopen ArithmeticFunctionopen scoped omega Omeganamespace Erdos306Let $\frac a b\in \mathbb{Q}_{>0}$ with $b$ squarefree. Are there integers $1 < n_1 < \dots < n_k$, each the product of two distinct primes, such that $\frac{a}{b}=\frac{1}{n_1}+\cdots+\frac{1}{n_k}$?
The answer is yes [Li26].
@[category research solved, question, AMS 11, formal_proof using lean4 at
"https://github.com/linrock/math-proofs/blob/e1a5e2a3317007f0e31b98bf2e80383187b31238/erdos-306/Solution.lean#L34"]
theorem erdos_306 : ∀ (q : ℚ), 0 < q → Squarefree q.den →
∃ k : ℕ, ∃ (n : Fin (k + 1) → ℕ), n 0 = 1 ∧ StrictMono n ∧
(∀ i ∈ Finset.Icc 1 (Fin.last k), ω (n i) = 2 ∧ Ω (n i) = 2) ∧
q = ∑ i ∈ Finset.Icc 1 (Fin.last k), (1 : ℚ) / (n i) := ⊢ ∀ (q : ℚ),
0 < q →
Squarefree q.den →
∃ k n,
n 0 = 1 ∧
StrictMono n ∧
(∀ i ∈ Finset.Icc 1 (Fin.last k), ω (n i) = 2 ∧ Ω (n i) = 2) ∧
q = ∑ i ∈ Finset.Icc 1 (Fin.last k), 1 / ↑(n i)
All goals completed! 🐙Every positive integer can be expressed as an Egyptian fraction where each denominator is the product of three distinct primes.
@[category research solved, AMS 11, formal_proof using lean4 at
"https://github.com/linrock/math-proofs/blob/e1a5e2a3317007f0e31b98bf2e80383187b31238/erdos-306/Solution.lean#L48"]
theorem erdos_306.variants.integer_three_primes (m : ℕ) (h : 0 < m) :
∃ k > (0 : ℕ), ∃ (n : Fin (k + 1) → ℕ), n 0 = 1 ∧
∀ i, (hik : i < k) → n ⟨i, m:ℕh:0 < mk:ℕn:Fin (k + 1) → ℕi:ℕhik:i < k⊢ i < k + 1 All goals completed! 🐙⟩ < n ⟨(i + 1), m:ℕh:0 < mk:ℕn:Fin (k + 1) → ℕi:ℕhik:i < k⊢ i + 1 < k + 1 All goals completed! 🐙⟩ ∧
(∀ i ∈ Finset.Icc 1 (Fin.last k), ω (n i) = 3 ∧ Ω (n i) = 3) ∧
m = ∑ i ∈ Finset.Icc 1 (Fin.last k), (1 : ℚ) / (n i) := m:ℕh:0 < m⊢ ∃ k > 0,
∃ n,
n 0 = 1 ∧
∀ (i : ℕ) (hik : i < k),
n ⟨i, ⋯⟩ < n ⟨i + 1, ⋯⟩ ∧
(∀ i ∈ Finset.Icc 1 (Fin.last k), ω (n i) = 3 ∧ Ω (n i) = 3) ∧
↑m = ∑ i ∈ Finset.Icc 1 (Fin.last k), 1 / ↑(n i)
All goals completed! 🐙end Erdos306