Divisor Count of 2

From ProofWiki
Jump to navigation Jump to search

Example of Use of Divisor Count Function

$\map {\sigma_0} 2 = 2$

where $\sigma_0$ denotes the divisor count function.


Proof

We have that $2$ is a prime number.

From Divisor Count Function of Prime Number:

$\map {\sigma_0} 2 = 2$

$\blacksquare$