Erdős problem 1110
Let be two coprime integers. We call representable if it is the sum of integers of the form , none of which divide each other.
How the state got here
0 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingNothing recorded 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:1a2283eb18ad10a7cd64ad291edcb2ef921ed84cc69a1299235eca00e0d86468
- Metadata
- sha256:a88e927b9a63b7212f507b4e732d38bbfc527beae8c8116f79f1c35b45a3c000
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:7029a943f0e4306f3bab97a3829f459192e5c61a86391ce2bc980b1ffcb49b53
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb