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 124 - ne zero
Let k=0 and 3≤d1<d2<⋯<dr
be integers of gcd equal to
1
such that
1≤i≤r∑di−11≥1.
Can all sufficiently large integers be written as a sum of the shape
∑iciai
where
ci∈{0,1}
and
ai
is divisible by
dik
and has only the digits
0,1
when
written in base
di
?
Conjectured by Burr, Erdős, Graham, and Li [BEGL96]
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.