Erdős Problem #282
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Let \(A\subseteq \mathbb{N}\) be an infinite set and consider the following greedy algorithm for a rational \(x\): choose the minimal \(n\in A\) not used so far such that \(n\geq 1/x\) and repeat with \(x\) replaced by \(x-\frac{1}{n}\). This process of subtracting unit fractions is modelled in `greedyUnitFractionRem`. At each step `t : ℕ`, the function `greedyUnitFractionRem A x t` returns the remainder of `x` with respect to the first `t + 1` unit fractions, with distinct denominators taken from `A`. Once
Attempts
submit one →Read our working report →
Exact distinct-odd greedy termination verified for all 202,660 reduced fractions a/b with odd b<=999 (at most 27 terms), plus a rigorous reduction to the below-2/3 convention; uniform termination rema
PARTIAL