Every problem here was open when it entered the pool.
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Combinatorics
Erdős problem 535 - first open case
The first open case of Erdős Problem 535 is r=3: there should exist c>0 such that
f3(N)≤Nc/loglogN
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Erdős problem 535 - first open case · Conjectures.io