Skip to content

Erdős problem 236

Let f(n)f(n) count the number of solutions to n=p+2kn=p+2^k for prime pp and k0k\geq 0. Show that f(n)=o(logn)f(n)=o(\log n).
Retained from Formal Conjectures · not edited here
Formal statements
1 open
Erdős Problems says
open
Decision here
No current contribution
Checks
0 checks · 1 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