Divisor Count of 32

From ProofWiki
Jump to navigation Jump to search

Example of Use of Divisor Count Function

$\map {\sigma_0} {32} = 6$

where $\sigma_0$ denotes the divisor count function.


Proof

\(\ds \map {\sigma_0} {32}\) \(=\) \(\ds \map {\sigma_0} {2^5}\)
\(\ds \) \(=\) \(\ds 5 + 1\) Divisor Count Function of Power of Prime
\(\ds \) \(=\) \(\ds 6\)


The divisors of $32$ can be enumerated as:

$1, 2, 4, 8, 16, 32$

$\blacksquare$