Skip to content

Erdős problem 1110

Let p>q2p>q\geq 2 be two coprime integers. We call nn representable if it is the sum of integers of the form pkqlp^kq^l, none of which divide each other.

Result history

Published changes, performers, checks, and later corrections.

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 detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:1a2283eb18ad10a7cd64ad291edcb2ef921ed84cc69a1299235eca00e0d86468
Metadata
sha256:a88e927b9a63b7212f507b4e732d38bbfc527beae8c8116f79f1c35b45a3c000
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:7029a943f0e4306f3bab97a3829f459192e5c61a86391ce2bc980b1ffcb49b53
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page