Divisor Counting Function/Examples/110

From ProofWiki
Jump to navigation Jump to search

Example of Use of $\tau$ Function

$\map \tau {110} = 8$

where $\tau$ denotes the $\tau$ function.


Proof

From Tau Function from Prime Decomposition:

$\ds \map \tau 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:

$110 = 2 \times 5 \times 11$

Thus:

\(\ds \map \tau {110}\) \(=\) \(\ds \map \tau {2^1 \times 5^1 \times 11^1}\)
\(\ds \) \(=\) \(\ds \paren {1 + 1} \paren {1 + 1} \paren {1 + 1}\)
\(\ds \) \(=\) \(\ds 8\)

The divisors of $110$ can be enumerated as:

$1, 2, 5, 10, 11, 22, 55, 110$

This sequence is A018288 in the On-Line Encyclopedia of Integer Sequences (N. J. A. Sloane (Ed.), 2008).


$\blacksquare$