MathOverflow is a question and answer site for professional mathematicians. 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

If $x,y,z$ are coprime, this equation has not any solution with an elementary method. I want to know a solution of this equation when $x,y,z$ are not coprime.

share|cite|improve this question
$$\frac1{2^{1638}}+\frac1{2^{1638}}=\frac1{2^{1637}}$$ – Wadim Zudilin Aug 1 '10 at 10:33
@wadim thank you for example, buti need complate solution – Hashem sazegar Aug 1 '10 at 11:22
I need an explanation: Why 1638? Isn't $\frac{1}{2^{42}}+\frac{1}{2^{42}}=\frac{1}{2^{41}}$ more canonical? – Helge Aug 1 '10 at 12:03
@Helge, that a hint: . But your solution is worth canonisation as well. :-)$$\ $$ @Hashem, yes I have the feeling that you wish more. ;-) – Wadim Zudilin Aug 1 '10 at 13:12
Wadim, Helge is correct. The Hitchhiker's Guide to the Galaxy. In the first novel and radio series, a group of hyper-intelligent pan-dimensional beings demand to learn the Ultimate Answer to the Ultimate Question of Life, The Universe, and Everything from the supercomputer, Deep Thought, specially built for this purpose. It takes Deep Thought 7½ million years to compute and check the answer, which turns out to be 42. – Will Jagy Aug 2 '10 at 3:32

Here's a way to construct a solution for each triple $(m,n,t)$ of pairwise coprime integers.

Start by choosing your favorite $a,b,c$ so that $a+b=c$ and write down the prime factorizations $$a=\prod_{i=1}^k p_i^{\alpha_i} \ , \ b=\prod_{i=1}^k p_i^{\beta_i} \ , \ c=\prod_{i=1}^k p_i^{\gamma_i}.$$ Now, by the Chinese remainder theorem find large enough $\delta_i$'s so that $$\alpha_i-\delta_i\equiv 0\pmod{m}$$ $$\beta_i-\delta_i\equiv 0\pmod{n}$$ $$\gamma_i-\delta_i\equiv 0\pmod{t}$$ and denote $D=\prod_{i=1}^k p_i^{\delta_i}$. You have $$\frac{a}{D}+\frac{b}{D}=\frac{c}{D}$$ and so $x^{-m}+y^{-n}=z^{-t}$ for some integers $x,y,z$.

share|cite|improve this answer

Here's another way to construct a solution for each triple $(m,n,t)$ of pairwise coprime integers. Find $u$ and $v$ such that $mnu-tv=1$ (so all that's really necessary is that $t$ be relatively prime to $mn$). Then $${1\over(2^{nu})^m}+{1\over(2^{mu})^n}={1\over(2^v)^t}$$

share|cite|improve this answer
that's what you get from my construction above, if you start with $1+1=2$ :) – Gjergji Zaimi Aug 1 '10 at 23:18
True. I guess instead of calling it "another way" I should have called it the simplest instance of your way. – Gerry Myerson Aug 2 '10 at 1:20

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.