Erdős problem 885Is it true that, for every k≥1k \geq 1, there exist integers N1<⋯<NkN_1 < \dots < N_k such that ∣∩iD(Ni)∣≥k|\cap_i D(N_i)| \geq k?WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 8855 retained source recordsCanvaspublic previewSource#885→ResultNone→Checks0