Divisor Count of 40,311
Jump to navigation
Jump to search
Example of Use of Divisor Count Function
- $\map {\sigma_0} {40 \, 311} = 8$
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:
- $40 \, 311 = 3^3 \times 1493$
Thus:
\(\ds \map {\sigma_0} {40 \, 311}\) | \(=\) | \(\ds \map {\sigma_0} {3^3 \times 1493^1}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds \paren {3 + 1} \paren {1 + 1}\) | ||||||||||||
\(\ds \) | \(=\) | \(\ds 8\) |
The divisors of $40 \, 311$ can be enumerated as:
- $1, 3, 9, 27, 1493, 4479, 13 \, 437, 40 \, 311$
$\blacksquare$