Skip to content

Erdős problem 1110

Let p>q≥2p>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.

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Where the source files it575 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.