One of Paul Erdős' favorite problems was the sunflower conjecture, due to him and Rado. Erdős offered $1000 for its proof or disproof.

The sunflower problem asks how many sets of some size are necessary before there are some whose pairwise intersections are all the same. The best known bound was improved in 2019 to something the form ; see here for the original paper and here for a slightly better bound. The sunflower conjecture asks whether there is a bound for some constant .

*Will the sunflower conjecture be resolved before 2060?*

This question will resolve positively in the event of a publication in a major mathematics journal resolving the sunflower conjecture. If there is no such proof by 2060-01-01, the question will resolve negative. If a proof is published, but not confirmed by peer review by 2060-01-01, the question may wait to resolve until peer review has reached a consensus.