Erdős problem 236Let f(n)f(n) count the number of solutions to n=p+2kn=p+2^k for prime pp and k≥0k\geq 0. Show that f(n)=o(logn)f(n)=o(\log n).WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 2362 retained source recordsCanvaspublic previewSource#236→ResultNone→Checks0