Erdős Problem #885 — For integer n≥ 1 we define the factor difference set of n by D(n) = lvert a-brvert : n=ab. Is it true that, for every k≥ 1, there exist integers N_1<…<N_k such that…
Statement
For integer we define the factor difference set of by Is it true that, for every , there exist integers such that
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.