Order of Divisor Count Function
Jump to navigation
Jump to search
Theorem
For all $x \ge 1$:
- $\ds \sum_{n \mathop \le x} \map {\sigma_0} n = x \log x + \paren {2 \gamma - 1} x + \map \OO {\sqrt x}$
where:
- $\gamma$ is the Euler-Mascheroni constant
- $\map {\sigma_0} n$ is the divisor count function.
Proof
This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |