Divisor Count of 168
Jump to navigation
Jump to search
Example of Use of Divisor Count Function
- $\map {\sigma_0} {168} = 16$
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:
- $168 = 2^3 \times 3 \times 7$
Thus:
\(\ds \map {\sigma_0} {168}\) | \(=\) | \(\ds \map {\sigma_0} {2^3 \times 3^1 \times 7^1}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \paren {3 + 1} \paren {1 + 1} \paren {1 + 1}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds 16\) |
The divisors of $168$ can be enumerated as:
- $1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 168$
This sequence is A018314 in the On-Line Encyclopedia of Integer Sequences (N. J. A. Sloane (Ed.), 2008).
$\blacksquare$