Pyramids of Egypt

Let \(d(k)\) denote the number of positive divisors of an integer \(k\), including 1 and itself, and let \(n\) be a positive integer. In terms of \(n\), how many ordered pairs of integers \((x,y)\) are there such that \(\dfrac{1}{x}+\dfrac{1}{y}=\dfrac{1}{n}\)?

×

Problem Loading...

Note Loading...

Set Loading...