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
Withdrawn
Erdős problem 1055 - erdos limit
A prime p is in class 1 if the only prime divisors of p+1 are
2 or 3
. In general, a prime
p
is in class
r
if every prime factor
of
p+1
is in some class
≤r−1
, with equality for at least one prime factor.
If
pr
is the least prime in class
r
, then how does
pr1/r
behave?
Erdos conjectured that this tends to infinity.
Withdrawn 5 Aug 2026
TYPE_DEPENDS_ON_SORRY (Erdos1055.p := Nat.find (exists_p r), exists_p is sorried)
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.