Skip to content

Erdős problem 845

Let C>0C > 0. Is it true that the set of integers of the form n=b1+⋯+btn = b_1 + \cdots + b_t, with b1<⋯<btb_1 < \cdots < b_t, where bi=2ki3lib_i = 2^{k_i}3^{l_i} for 1≤i≤t1 \leq i\leq t and bt≤Cb1b_t \leq Cb_1 has density 00?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:3b05a97fc5a4f3192ed23820b8b0a8e80532a16dd07f8ef8b3b3ad0bf419312b
Metadata
sha256:2296ed1f9d5363767577c95d85b8c499c09a8a7a2f980b0adb18c486fc6313dc
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:574a8f63171b39878d35dd9c942ff417f0528775a92648d153a0e6b0e964f09f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb