Erdős Problem #536 — Let ε>0 and N be sufficiently large.
Statement
Let and be sufficiently large. Is it true that if has size at least then there must be distinct such that where denotes the least common multiple?
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.