Erdős problem 885 · problems.science

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$ ?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/885.lean

Formal Conjectures

FormalConjectures/ErdosProblems/885.leanErdos885.erdos_8851 lineExact file

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

OpenStatement only, no proof