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.
Erdős problem 726 · Conjectures.io
Number theory
Erdős problem 726
As n→∞ ranges over integers
∑p≤n1n∈(p/2,p)(modp)p1∼2loglogn?
A conjecture of Erdős, Graham, Ruzsa, and Straus [EGRS75].
By n∈(p/2,p)(modp) we mean n≡r(modp) for some integer r with p/2<r<p.
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.