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 k0k \geq 0 and nn has at most rr prime divisors, is at least 1ϵ1-\epsilon?

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:e187c500462dd75de4349b76c010fac87a0d079040768a4b22ca9de5988e022b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page