No denominator is divisible by a prime above one third of the range
ProvedErdos287.no_denominator_multiple_of_large_prime_above_thirdnumber-theoryp-adicunit-fractions
Let and let be pairwise distinct integers greater than , all bounded by , such that
For any prime with , no denominator is divisible by :
Equivalently, every prime factor greater than that occurs in a denominator is at most . This is a p-adic exclusion constraint for Egyptian-fraction representations, and can be used alongside restrictions on the spacing of denominators.
Preamble
import Mathlib.NumberTheory.Padics.PadicNorm import Mathlib.Tactic
Formal statement
namespace Erdos287
theorem no_denominator_multiple_of_large_prime_above_third
(k : ℕ) (hk : 2 ≤ k) (f : ℕ → ℕ)
(hf1 : ∀ i, i < k → 1 < f i)
(hsum : ∑ i ∈ Finset.range k, (1 : ℚ) / f i = 1)
(hdist : ∀ i j, i < k → j < k → i ≠ j → f i ≠ f j)
(N : ℕ) (hbound : ∀ i, i < k → f i ≤ N)
(p : ℕ) (hp : Nat.Prime p) (hp3 : 3 < p) (hN : N < 3 * p)
(i : ℕ) (hi : i < k) : ¬ p ∣ f i := by sorry
end Erdos287Source
Auxiliary result derived from the proved p-adic multiplicity theorem in the Erdős Problem 287 mission; see https://www.erdosproblems.com/287.