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 282
Let A⊆N be an infinite set and consider the following
greedy algorithm for a rational x∈(0,1): choose the minimal n∈A
such
that
n≥1/x
and repeat with
x
replaced by
x−n1
. If this
terminates after finitely many steps then this produces a representation of
x
as the sum of distinct unit fractions with denominators from
A
.
Does this process always terminate if
x
has odd denominator and
A
is the
set of odd numbers?
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.