MathLabs

Problem 3

For any positive integer n n , let d(n) d(n) denote the number of positive divisors of n n (including 11 and n n itself). Determine all positive integers k k such that d(n2)d(n)=k\frac{d(n^2)}{d(n)}=k for some n n .
Step 2 of 6: Prove necessity
In plain words

A divisor of an odd number is odd.

d(n2) is odd⇒k is oddd(n^2)\text{ is odd}\Rightarrow k\text{ is odd}
Detailed analysis

Because n2 n^2 is a perfect square, every exponent in its factorization is even and d(n2) d(n^2) is odd. Since k=d(n2)/d(n) k=d(n^2)/d(n) is an integer, k k divides the odd integer d(n2) d(n^2); therefore k k must be odd.