Is it possible to choose 2n points in an n by n grid in the plane so that no three are collinear
Statement
Dudeney: Is it possible to choose 2n points in an n by n grid in the plane so that no three are collinear? Conjecture: no. In fact, it is conjectured that the answer is still "no" unless 2 is changed to something less than Ŕ/3 = 1.813799.... However, this problem dates back to 1917 and little is known about it. See this.
Record
- Source
- Added
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.