KöMaL 2017 B4881

Let $d(n)$ denote the number of (positive) factors of the number $n$ . Prove that $n+d(1)+d(2)+\cdots +d(n)\le d(n+1)+d(n+2)+\dots +d(2n).$

Official text KöMaL. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.