noting that S(1)=1. Prove that the sum extended over all divisors d of some number n
∑S(d)={10
according to whether n is a perfect square or not. (The unit and n itself are also counted among the divisors).
This one wants a proof. Work it on paper, read the official solution, then mark
yourself honestly — the ladder only means something if the record is true.
Official solution
If we carry out the indicated product in the following expression:
we obtain an algebraic sum whose terms will be products formed from the prime divisors (p1,p2,…,p3), where p1 will appear in the 0,1,2,… or α1-th power; p2 in the 0,1,2,… or α2-th power; ... and finally pr in the 0,1,2,… or αr-th power. Each term will thus be a divisor of m, and since all such products that can be formed under the mentioned conditions are present in the expansion of (1), each divisor of m will appear exactly once among the terms; the divisors will now appear in this sum with a positive sign for which α1+α2+… is even, so S(d)=1, while with a negative sign those terms will appear in the expansion for which S(d)=−1. Thus, to obtain the desired ∑S(d), it is sufficient to substitute 1 for all p's in (1). In this case, in the expansion of (1), 1 or -1 will appear in place of each term, depending on whether S(d)=1 or S(d)=−1. Thus, indeed, the expansion of (1) gives the value of ∑S(d) when 1 is substituted for all p's.
The number m=p1α1p2α2…prαr is a perfect square if and only if all α's are even; in this case, the expressions in each row of (1) will be equal to 1, and thus their product: ∑S(d)=1. However, if even one α, for example, αr, is odd, i.e., m is not a perfect square, then the expression in the r-th row of (1) will be 0, and thus the entire expression ∑S(d)=0.
(Dénes König, Budapest.)
The problem was also solved by: Bartók I., Dömény I., Haar A., Szücs A.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.