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 385 - part i
Let F(n):=max{m+p(m)∣m<n composite}} where p(m)
is the least
prime divisor of
m
. Is it true that
F(n)>n
for all sufficiently large
n
?
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.