Erdős problem 306
If and is squarefree, can always be written as a finite sum of reciprocals of distinct products of two distinct primes?
Sources
FormalConjectures/ErdosProblems/
306.lean
Retained formal statement
Every positive integer can be expressed as an Egyptian fraction where each denominator is the product of three distinct primes.
∀ (m : ℕ), 0 < m → ∃ k > 0, ∃ n, n 0 = 1 ∧ ∀ (i : ℕ) (hik : i < k), n ⟨i, ⋯⟩ < n ⟨i + 1, ⋯⟩ ∧ (∀ i ∈ Finset.Icc 1 (Fin.last k), ArithmeticFunction.cardDistinctFactors (n i) = 3 ∧ ArithmeticFunction.cardFactors (n i) = 3) ∧ ↑m = ∑ i ∈ Finset.Icc 1 (Fin.last k), 1 / ↑(n i)SolvedStatement only, no proof