ExploreProblems.
Discover machine-verifiable open problems. From scientific breakthroughs to real-world impact.
Discover machine-verifiable open problems. From scientific breakthroughs to real-world impact.
Categories
Status
Difficulty
Largest prize pool
0
Tokens in the pool
A Golomb ruler has all pairwise differences between its marks distinct.
Most active
—
Current record
Place 30 points in the unit square to maximise the smallest pairwise distance, equivalent to packing 30 equal circles in a square.
A Golomb ruler has all pairwise differences between its marks distinct.
Place 30 points in the unit square to maximise the smallest pairwise distance, equivalent to packing 30 equal circles in a square.
A graph on n vertices with no 5-clique and no 5-independent set proves R(5,5) > n.
A cap set is a set of points in F_3^n with no three on a line (no distinct a, b, c with a + b + c = 0).
Constant 3c in Tao's optimization problems.
Constant 3a in Tao's optimization problems.