Erdős problem 236

Let $f(n)$ count the number of solutions to $n=p+2^k$ for prime $p$ and $k\geq 0$ . Show that $f(n)=o(\log n)$ .

Sources

The source's own material, retained exactly.

1 retained statement36c6d0fef71a

FormalConjectures/ErdosProblems/

236.lean

Retained formal statement1 of 1

Let $f(n)$ count the number of solutions to $n=p+2^k$ for prime $p$ and $k\geq 0$ . Show that $f(n)=o(\log n)$ .

FormalConjectures/ErdosProblems/236.leanErdos236.erdos_2361 lineExact file

1(fun n => ↑(Erdos236.f n)) =o[Filter.atTop] fun n => Real.log ↑n

OpenStatement only, no proof