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.
Combinatorics
Paused
Erdős problem 340
Let A={1,2,4,8,13,21,31,45,66,81,97,…}
be the greedy Sidon sequence:
we begin with
1
and iteratively include the next smallest integer that preserves the
Sidon property (i.e. there are no non-trivial solutions to
a+b=c+d
). What is the
order of growth of
A
? Is it true that
∣A∩{1,…,N}∣≫N1/2−ε
for all
ε>0
and 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.