Erdős Problem #465 — Many planar points with distances away from integers
Statement
Let be the largest number of points in a disk of radius whose pairwise distances stay at least from every integer. For fixed , is ? More strongly, is ?
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.