Skip to content

Erdős problem 851

Let ϵ>0\epsilon > 0. Is there some r≪ϵ1r \ll_\epsilon 1 such that the density of integers of the form 2k+n2^k+n, where k≥0k \geq 0 and nn has at most rr prime divisors, is at least 1−ϵ1-\epsilon?

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:1406cc70033ef0f39b8420b964a16eb10386a3f385cb9c834357427e69cc6ad4
Metadata
sha256:d55874ba75f1a0bbb13beccdf9e85b74eb991f20d9068082fdc9733feaf81f21
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:e187c500462dd75de4349b76c010fac87a0d079040768a4b22ca9de5988e022b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb