Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Question: Is there anyway to find how many integer solutions there are to the formula $$1=\frac{x\cdot y}{(x+y)\cdot (R!)}$$ for any given $R$. Is there anyway to compute it and if so, compute it quickly.

share|cite|improve this question
Do you mean $((x+y)\cdot R)!$ or $(x+y)\cdot (R!)$ ? – Zev Chonoles Dec 24 '11 at 12:12
A good hint is at MO: – David Mitra Dec 24 '11 at 12:16
up vote 2 down vote accepted

Yes, by @David Mitra's hint (, the equation reduces to $(x-n)(y-n)=n^2$ for $n=R!$. Now if $n=\prod_1^r{p_k^{e_k}}$ is the unique factorization into the $r$ distinct primes $p_k \leq R$ (e.g. where $e_k=\sum_{i=0}^{\infty}[np_k^{-i}]$), then the number of (positive) divisors of $n^2=\prod{p_k^{2e_k}}$ is $\tau(n^2)=\prod{(1+2e_k)}$ since each positive divisor is of the form $u=\prod{p_k^{f_k}}$ where $0\leq f_k \leq 2e_k$ (so that the exponents $f_k$ are $r$-tuples of integer lattice points inside a $r$-dimensional rectangular solid), and for each such $u$ dividing $n^2$, we can take $v=n^2/u$ and write two unique integer solutions: $(x,y)=(n+u,n+v)$ and $(x,y)=(n-u,n-v)$. Thus, the total number of solutions is $$ 2\;\tau(R!^2) = 2\;\tau(n^2) = 2\;\prod_{k=1}^{r}(1+2e_k) $$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.