Category:Divisor Count Function from Prime Decomposition

From ProofWiki
Jump to navigation Jump to search

This category contains pages concerning Divisor Count Function from Prime Decomposition:


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

Let the prime decomposition of $n$ be:

$n = p_1^{k_1} p_2^{k_2} \cdots p_r^{k_r}$

Let $\map {\sigma_0} n$ be the divisor count function of $n$.


Then:

$\ds \map {\sigma_0} n = \prod_{j \mathop = 1}^r \paren {k_j + 1}$

Pages in category "Divisor Count Function from Prime Decomposition"

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