Erdős problem 46 · problems.science

Does every finite colouring of the integers have a monochromatic solution to $1=\sum \frac{1}{n_i}$ with $2\leq n_1<\cdots <n_k$ ?

Sources

Browse retained paths and inspect the exact material available for this Problem.

3 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

46.lean

Retained formal statement2 of 3

Croot [Cr03] proved more: there are infinitely many disjoint such monochromatic solutions.

FormalConjectures/ErdosProblems/46.leanErdos46.erdos_46.variants.infinitely_many_disjoint6 linesExact file

1True ↔2  ∀ (𝓒 : ℕ → ℕ),3    (Set.range 𝓒).Finite →4      ∃ S,5        (∀ (i j : ℕ), i ≠ j → Disjoint (S i) (S j)) ∧6          ∀ (i : ℕ), (∀ n ∈ S i, 2 ≤ n) ∧ ∑ n ∈ S i, 1 / ↑n = 1 ∧ (𝓒 '' ↑(S i)).Subsingleton

SolvedStatement only, no proof

Sources

Search problems.science