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 364 - strong
Erdős [Er76d] conjectured a stronger statement: if nk is the kth powerful number,
then nk+2−nk>nkc
for some constant
c>0
.
[Er76d] Erdős, P., Problems and results on number theoretic properties of consecutive integers and related questions. Proceedings of the Fifth Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man., 1975) (1976), 25-44.
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.