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
Paused
Erdős problem 142 - lower
Show that rk(N)=ok(N/logN)
, where
rk(N)
the largest possible size of a subset
of
{1,…,N}
that does not contain any non-trivial
k
-term arithmetic progression.
Pin rotation in progress; nothing can be submitted right now.
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.