Category:Examples of Divisor Counting Function

From ProofWiki
Jump to navigation Jump to search

This category contains examples of Divisor Counting Function.

Let $n$ be an integer such that $n \ge 1$.

The divisor counting function is defined on $n$ as being the total number of positive integer divisors of $n$.

It is denoted on $\mathsf{Pr} \infty \mathsf{fWiki}$ as $\sigma_0$ (the Greek letter sigma).

That is:

$\ds \map {\sigma_0} n = \sum_{d \mathop \divides n} 1$

where $\ds \sum_{d \mathop \divides n}$ is the sum over all divisors of $n$.

Pages in category "Examples of Divisor Counting Function"

The following 146 pages are in this category, out of 146 total.

D