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?
Retained from Formal Conjectures · not edited here
Formal statements
2 solved
Erdős Problems says
proved
Decision here
No current contribution
Checks
0 checks · 2 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page