Erdős Problem #885 — Common factor differences
For each positive integer n, define its factor-difference set using positive integer factors:
Is it true that for every integer k\ge 1 there exist positive integers N_1<\cdots<N_k such that
Background
Erdős and Rosenfeld posed the intersection question in August 1995; their 1997 paper introduced the factor-difference set in print. One motivation came from Erdős’s question about placing points in the plane so that many pairwise distances are odd integers. In their proposed configuration, an odd integral distance D from a point on the vertical axis to a suitably chosen point on the horizontal axis yields a factorization of 4p^2 whose factor difference is 4j+2. This links the geometric problem to finding many prescribed differences in factor-difference sets. Erdős and Rosenfeld (1997)
The paper proved that any fixed pair of distinct differences occurs together in D(M) for only finitely many integers M. It then used this finiteness to construct arbitrarily many distinct integers sharing two differences, while noting that it had not found a construction giving arbitrarily many shared differences. Explicit examples of three integers sharing four differences helped motivate the conjecture posed here. Erdős and Rosenfeld (1997)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.