Erdős Problem #466 — Unbounded integer-avoiding planar distance sets
Statement
With defined as the largest number of points in a disk of radius whose pairwise distances remain at least from every integer, does some fixed satisfy ?
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.