Skip to content

Erdős problem 124

Let k≠0k \ne 0 and 3≤d1<d2<⋯<dr3\leq d_1 < d_2 < \cdots < d_r be integers of gcd equal to 11 such that ∑1≤i≤r1di−1≥1.\sum_{1 \le i \le r}\frac 1{d_i - 1} \ge 1. Can all sufficiently large integers be written as a sum of the shape ∑iciai\sum_i c_ia_i where ci∈{0,1}c_i \in \{0, 1\} and aia_i is divisible by dikd_i ^ k and has only the digits 0,10, 1 when written in base did_i?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:b175ee5fc94a2de2f505b1d3783edc692d4fa40f3e683e9cff41b00f00bc7546
Metadata
sha256:886f8cffd0fe1de4ca829f7f03f93049193621ccb4148959eda880a89ecae56b
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:3a80aa9d29a04876d90033664ce874e82a44a9f61081471fd2a5e0698c94be69
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb