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 .
Erdős Problems records this as disproved.
No Repository has ruled on it here.
How far the record reaches4 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal1 retained
- Resolutiondisproved
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingWork
Nothing here has checked that finding.
Reproducing it here turns a report into evidence.
Where the source files it575 share a topic
Erdős problem 321acceptedCarrying a Standing. Browse the topic.