Divisor Count of 140

From ProofWiki
Jump to navigation Jump to search

Example of Use of Divisor Count Function

$\map {\sigma_0} {140} = 12$

where $\sigma_0$ denotes the divisor count function.


Proof

From Divisor Count Function from Prime Decomposition:

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

where:

$r$ denotes the number of distinct prime factors in the prime decomposition of $n$
$k_j$ denotes the multiplicity of the $j$th prime in the prime decomposition of $n$.


We have that:

$140 = 2^2 \times 5 \times 7$

Thus:

\(\ds \map {\sigma_0} {140}\) \(=\) \(\ds \map {\sigma_0} {2^2 \times 5^1 \times 7^1}\)
\(\ds \) \(=\) \(\ds \paren {2 + 1} \paren {1 + 1} \paren {1 + 1}\)
\(\ds \) \(=\) \(\ds 12\)


The divisors of $140$ can be enumerated as:

$1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 70, 140$

This sequence is A018301 in the On-Line Encyclopedia of Integer Sequences (N. J. A. Sloane (Ed.), 2008).

$\blacksquare$