Erdős problem 253
Let be an infinite sequence of positive integers such that . If every arithmetic progression contains infinitely many integers which are the sum of distinct then every sufficiently large integer is the sum of distinct .
How the state got here
1 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingA Result stands here
- Next gapNot recorded
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:c3083de31a4e2145a4102a24efcb7a50737482ae2fa5c4d8cedde5226539084a
- Metadata
- sha256:ed1b3f00754864ad16bc51c1c6698f7cda99b00a35637062d6a8fbbff00d0376
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:3757c354edb978cacec0d7157945a551505a3922ebd8cb049515fb8c25189b70
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb