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.
Number theory
Erdős problem 359 - part i
Let a1<a2<⋯ be an infinite sequence of integers such that a1=1
and
ai+1
is the
least integer which is not a sum of consecutive earlier
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.