ErdosProblems · research open · AMS 5 11

unsolvedsorry — nobody on it

Erdős Problem 236

Conjecture 236 · Erdős

Let 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(log⁡n)f(n)=o(\log n).

Formal statement · Lean 4.lean
theorem erdos_236: (fun n => (f n : ℝ)) =o[atTop] (fun n => Real.log (n : ℝ)) := by
  sorry

Proof. sorry

Nobody has tried yet.

Reference ↗ · Lean source ↗