CollapseProblem 236Let f(n)f(n)f(n) count the number of solutions to n=p+2kn=p+2^kn=p+2k for prime ppp and k≥0k\geq 0k≥0. Is it true that f(n)=o(logn)f(n)=o(\log n)f(n)=o(logn)?Source: erdosproblems.com/236Number theoryPrimesWiki pageStatusOpenNo claim settles this problem.ReferencesEr50Erdős, P., On integers of the form 2k+p2^k+p2k+p and some related problems. Summa Brasil. Math. (1950), 113-123.