Eine Klasse von Abzählproblemen

MaRDI QIDQ2556435zbMATH OpenFDO

Authors Peter Hohler

Publication date 1972

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/141083

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Review text

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\).)

Recommendations

• How often is the number of divisors of n a divisor of n ?
• On the divisor function d ( n ): II
• How Often Does the Number of Divisors of an Integer Divide Its Successor?
• On the number of divisors of \(n^{2}-1\)
• Counting divisors

Cited in

(2)

• Einige ungelöste Probleme der klassischen Analysis
• scientific article; zbMATH DE number 3909742 (Why is no real title available?)

This page was built for publication: Eine Klasse von Abzählproblemen

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556435)