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

Sources

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

4 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

885.lean

Retained formal statement1 of 4

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

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