Erdős problem 885

Is it true that, for every $k \geq 1$ , there exist integers $N_1 < \dots < N_k$ such that $|\cap_i D(N_i)| \geq k$ ?

Sources

The source's own material, retained exactly.

4 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

885.lean

Retained formal statement4 of 4

Bremner [Br19] proved this for $k=4$ .

FormalConjectures/ErdosProblems/885.leanErdos885.erdos_885.variants.k_eq_41 lineExact file

1∃ Ns, (∀ n ∈ Ns, 1 ≤ n) ∧ Ns.card = 4 ∧ (⋂ n ∈ Ns, Erdos885.factorDifferenceSet n).ncard ≥ 4

SolvedStatement only, no proof