The no 5 on a sphere problem
How many points can be chosen from the n × n × n grid so that no 5 of them lie on one sphere or one plane?
Summary
Problem 60 of the AlphaEvolve repository of problems (Georgiev, Gómez-Serrano, Tao and Wagner, 2025). C(n) is the size of the largest subset of the n × n × n grid with no 5 points on a sphere or a plane. It is known that C(n) ≤ 4n; the source asks for upper and lower bounds on C(n) that are as strong as possible.
Source
Open, as listed by AlphaEvolve repository of problems, problem 60 · AlphaEvolve repository of problems. Checked 20 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.