Erdős problem 254
If has unbounded dyadic-shell counts and for every , must be complete - is every sufficiently large integer a sum of distinct elements of ?
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:720bf949cfa3f25df178d86ee120b0f6abc764bc32507910018f43169e845566
- Metadata
- sha256:f0c5aa17dcfeadf31059b24c23004a78b217da257cfe6e0e252ea96c2da8607f
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:4f95f4bb8026df1fe094bbb1e1ea393e0e11046129503950df6adb06341991d0
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207