Skip to content

Erdős problem 123

Let a,b,c>1a,b,c>1 be pairwise coprime integers. Is every large integer a sum of distinct numbers of the form akblcma^k b^l c^m (k,l,m0k,l,m\ge 0), none dividing another?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#123
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Search problems.science

Find a Problem, Result, source, or page