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 445
Is it true that, for any c>1/2, if p is a sufficiently large prime then, for any
n≥0, there exist a,b∈(n,n+pc)
such that
ab≡1(modp)
?
This is discussed in this MathOverflow question [MathOverflow].
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.