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).

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/236.lean

Formal Conjectures

FormalConjectures/ErdosProblems/236.leanErdos236.erdos_2361 lineExact file
(fun n => ↑(Erdos236.f n)) =o[Filter.atTop] fun n => Real.logn
OpenStatement only, no proof

Continue

Search problems.science

Find a Problem, Result, source, or page