Problems and Theorems in Analysis · 6
Consider all possible factorizations of an even integer of the form , such that is odd (possibly 1) and is even. Then
is equal to the sum of the divisors of .
Let denote the number of decompositions of into a product of factors; only positive integers greater than 1 are admissible as factors, and two decompositions are regarded as equal if, and only if, they involve the same factors in the same order. For instance, and since
Show that, for ,
the difference between the number of even'' and odd'' decompositions, that is, decompositions into an even and an odd number of factors, respectively. For instance
(continued). Show that
equals if , the th power of a prime number , but equals 0 if is divisible by more than one prime. In the case we have
(continued). If is the product of different prime factors, then
(cf. the introduction to Problem 186 of Part I).
If is a prime and a positive integer, then
(For this particular case, verify 58.1 by using the binomial theorem; also cf. 58.2 with Problem 38 of Part I.)
For let denote the number of different decompositions of the integer into a product of integers greater than 1; two decompositions are not regarded as different if they involve the same factors, and so the order of factors does not matter (in contrast to 58.1); define . For instance . If is the product of different prime factors, then
(cf. the introduction to Problem 186 of Part I).
(continued). Show that
Let be a positive integer,
where are distinct primes, , . Set
if are all even, and otherwise. Show that is, in fact, the difference between the numbers of two different kinds of divisors of :
where the summation is extended over the odd divisors of .
( is the number of lattice points on the circle . This fact was discovered by Gauss.)
Which of the functions and are multiplicative?