divisor function is multiplicative, the
Theorem.
The divisor function (http://planetmath.org/TauFunction) is multiplicative.
Proof.
Let t=mn with m,n coprime.
Applying the fundamental theorem of arithmetic
, we can write
m=pa11pa22⋯parr,n=qb11qb22⋯qbss, |
where each pj and qi are prime. Moreover, since m and n are coprime, we conclude that
t=pa11pa22⋯parrqb11qb22⋯qbss. |
Now, each divisor of t is of the form
t=pk11pk22⋯pkrrqh11qh22⋯qhss. |
with 0≤kj≤aj and 0≤hi≤bi, and for each such divisor we get a divisor of m and a divisor of n, given respectively by
u=pk11pk22⋯pkrr,v=qh11qh22⋯qhss. |
Now, each respective divisor of m, n is of the form above, and for each such pair their product is also a divisor of t. Therefore we get a bijection between the set of positive divisors of t and the set of pairs of divisors of m, n respectively. Such bijection implies that the cardinalities of both sets are the same, and thus
d(mn)=d(m)d(n). |
Title | divisor function is multiplicative, the |
---|---|
Canonical name | DivisorFunctionIsMultiplicativeThe |
Date of creation | 2013-03-22 15:03:47 |
Last modified on | 2013-03-22 15:03:47 |
Owner | yark (2760) |
Last modified by | yark (2760) |
Numerical id | 9 |
Author | yark (2760) |
Entry type | Theorem |
Classification | msc 11A25 |