Erdős Problem #261
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).
A natural number \(n\) is said to have property `Erdos261Prop` if there exist \(t \ge 2\) pairwise distinct positive integers \(a_1, \ldots, a_t\) such that \(n / 2^n = \sum_{1 \le k \le t} a_k / 2^{a_k}\).
A canonical infinite representation of a rational number \(x\) by positive integers. The denominators are strictly increasing so that reorderings are not counted as different representations.
Attempts
submit one →Read our working report →
exact greedy constructions now verify every 1<=n<=100000, correct TUZ20's n=5588 table row, and reduce the uniform problem to a specific modular orbit; the all-n and rational-continuum questions remai
PARTIAL