Divisor Count of 64
Jump to navigation
Jump to search
Example of Use of Divisor Count Function
- $\map {\sigma_0} {64} = 7$
where $\sigma_0$ denotes the divisor count function.
Proof
| \(\ds \map {\sigma_0} {64}\) | \(=\) | \(\ds \map {\sigma_0} {2^6}\) | ||||||||||||
| \(\ds \) | \(=\) | \(\ds 6 + 1\) | Divisor Count Function of Power of Prime | |||||||||||
| \(\ds \) | \(=\) | \(\ds 7\) |
The divisors of $64$ can be enumerated as:
- $1, 2, 4, 8, 16, 32, 64$
$\blacksquare$