Eine Klasse von Abzählproblemen (Q2556435)

Three of the author's results are exemplified by: the number of positive integers \(x\) for which \(n+x\) divides \(nx\) is \(\frac12 \{d(n^2)-1\}\), where \(d(n^2)\) is the number of positive divisors of \(n^2\). (A shorter proof depends on rewriting \(x\)) as \((n + x) (n - y) = n^2\).) He also shows that the number of unordered pairs \(u,v\) with least common multiple \([u,v]=n\) is \(\frac12 \{d(n^2)+1\}\), and establishes a correspondence between the solutions \(x\) and \(u,v\). (There is a similar correspondence between solutions of \([r,s]=n\) and of \(lm=n^2\).)