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

The triangular numbers 15 and 21 have the property that both their sum and difference are triangular. There are another 4 pairs less than 1000. To complete this problem, I have done like this:

To satisfy the conditions, we have to find $u$, $v$, $w$, $x$ such that $$\begin{align*} \frac{u(u+1)}{2} + \frac{v(v+1)}{2} &= \frac{w(w+1)}{2}\\ \frac{v(v+1)}{2} - \frac{u(u+1)}{2} &= \frac{x(x+1)}{2}. \end{align*}$$ Multiplying by 8 and completing the squares, we have; $$\begin{align*} \Bigl( (2u+1)^2 -1\Bigr) + \Bigl( (2v+1)^2-1\Bigr) &= (2w+1)^2-1\\ \Bigl( (2v+1)^2 - 1\Bigr) - \Bigl( (2u+1)^2 - 1\Bigr) &= (2x+1)^2 - 1. \end{align*}$$

For convince representation, consider, $a = 2u +1$, $b = 2v + 1$, $c = 2w+1$ and $d = 2x +1$.

Then, we have; $a^2 + b^2 - 1 = c^2$ and $b^2 - a^2 + 1 = d^2$ by adding $2b^2 = c^2 + d^2$, hence $c^2 - b^2 = b^2 - d^2$ $$\frac{c-b}{b-d} = \frac{b+d}{b+c} = \frac{m}{n}$$ say, where $\gcd(m,n)=1$, $n\gt m$. Hence $$\begin{align*} -nb +nc &= -md + mb\\ b(m+n) -nc &= md\\ nd + nb &= mb + mc\\ b(n-m) &= mc - nd \end{align*}$$

I am so sorry...thereafter what to do and how to complete this problem, I don't know. If any one can solve, I am so grateful to them or discuss some other method to complete this problem.

share|cite|improve this question
(+1) for showing work. Let me/us know if the edited question accurately reflects the work that you have done. – The Chaz 2.0 Apr 3 '12 at 4:57
@The Chaz! thank you for your reply. – gandhi Apr 3 '12 at 4:58
There are infinite number of such pairs. One more, in addition to what you already have are $t_{39}$ and $t_{44}$. – Salech Alhasov Apr 3 '12 at 4:59
Here is what I did: One can convince himself that: $$t_{n+1}+t_{\frac{n(n+3)}{2}}=t_{\frac{n(n+3)}{2}+1}$$ Now, maybe should we look at the following difference: $$t_{\frac{n(n+3)}{2}}-t_{n+1}=\frac{n^2(n+3)^2}{4}$$ And all we left is to search for triangle numbers less than $1000$, for which: $\frac{n^2(n+3)^2}{4}$ is triangle number. Hm. – Salech Alhasov Apr 3 '12 at 5:43
35 solutions, but no general formula, can be found at Actually, that just gives what you are calling $u(u+1)/2$; $v(v+1)/2$ is given at; if you check the crossrefs you'll also find $x(x+1)/2,w(w+1)/2,u,v,x$ and $w$. – Gerry Myerson Apr 3 '12 at 5:58
up vote 9 down vote accepted

There are infinitely many solutions. I'll first give infinitely many, and then talk about describing the set of all solutions.

Let $(a,u)$ be a solution to Pell's equation $$a^2-24u^2 =1$$ with $a$ and $u$ odd. All the integer solutions to this equation are of the form $a+u\sqrt{24} = (5+\sqrt{24})^n$ (using the methods in the Wikipedia link) and, when $n$ is odd, so are $a$ and $u$. The first few values of $a$ and $u$ are: $(5,1)$, $(485, 99)$, $(47525, 9701)$, $(4656965, 950599)$...

Then $(a,b,c,d) = (a, 5u, 7u, u)$ obeys $$a^2-1 = 24u^2 = c^2-b^2 = d^2-c^2$$ and $(a,b,c,d)$ are all odd.

Let $p=c/b$ and $q=d/b$, so $p^2+q^2=2$. There is a standard method for describing rational points on a conic once you know one point. In this case, $(1,1)$ is on conic. Consider the line through $(1,1)$ with slope $k/\ell$. Its other intersection with the conic is at $$\left( 1-\frac{2k(k+\ell)}{k^2+\ell^2}, 1-\frac{2k(k+\ell)}{k^2+\ell^2} \right) = \left( \frac{-k^2-2k\ell+\ell^2}{k^2+\ell^2}, \frac{k^2-2k\ell-\ell^2}{k^2+\ell^2} \right).$$ The line between two rational points always has rational slope, so every rational solution to $p^2+q^2=2$ is of the above form. Clearing denominators, we have $$(b,c,d) = u \cdot (k^2+\ell^2, -k^2-2k\ell+\ell^2, k^2-2k\ell-\ell^2).$$ In order to get $(b,c,d)$ all odd, take $k$ and $\ell$ of different parities and $u$ odd. I found $(5,7,1)$ by taking $(k,\ell) = (1,2)$. (There are also some solutions where $u$ is a half integer and $k$ and $\ell$ are both odd. I didn't check this carefully, since my goal was to find infinitely many solutions, not to classify them all, but if you want to throughly understand the problem you should consider the possibility that the three terms inside parentheses have a common factor.)

In any case, my strategy was to think about fixing $(k, \ell)$ and looking for $u$'s such that the common difference $$d^2-c^2 = c^2 - b^2 = u^2 \cdot 4 k \ell (k^2 - \ell^2)$$ would be of the form $a^2-1$. This is just Pell's equation $$a^2 - Nu^2=1$$ with $N=4 k \ell (k^2 - \ell^2)$ and the auxilliary condition that $a$ and $u$ are odd.

Pell's equation will be solvable whenever $N>0$ and not a square. There are certainly plenty of examples when $N$ is not a square. In fact, it will never be a square unless it is $0$. If $N=m^2$ were square, then $c^2=b^2+(mu)^2$ and $d^2 = (mu)^2 + c^2$. Fermat showed that there are no solutions to $x^2+y^2=z^2$ and $y^2+z^2=t^2$ with $y \neq 0$, see here.

But will there be odd solutions to Pell's equation? Parity considerations show that, since $N$ is even, $a$ will always be odd. If the primitive solution $a_0 + u_0 \sqrt{N}$ to Pell's equation has $u_0$ odd, then so will the solutions of the form $(a_0+u_0 \sqrt{N})^{2m+1}$. But if $u_0$ is even, then every solution to Pell's equation will have $u$ even.

I don't know a principle which predicts which of these two cases will occur but, as the example above shows, $u_0$ is odd at least some of the time, and that's all you need for infinitely many solutions.

Just to show off, here's one more example. I'll take $(k, \ell) = (3,4)$. This leads to the discovery that $$31^2 - 25^2 = 25^2-17^2$$ We have $N = 336$. The primitive solution to $a^2 - 336 u^2 =1$ is $55^2-3^2\cdot 336=1$. So there are infinitely many solutions of the form $$(a,b,c,d) = (a, 25u, 31u, 17u)$$ the smallest of which is $$(55, 75, 93, 51).$$

share|cite|improve this answer
In the last paragraph $a^2-420u^2$ should read $a^2-336u^2$? – Zander Apr 3 '12 at 14:44
@David Speyer! What I am looking for, I got now. Thank you so much for your help. – gandhi Apr 3 '12 at 15:22
@David Speyer Sir, I am once again thankful to you, as your analysis made me more and more interested in working on Theory of Numbers. Thanks a lot. – gandhi Apr 3 '12 at 17:14
@Zander Yup, thanks! – David Speyer Apr 3 '12 at 17:15
In the second displayed equation, the $d^2-c^2$ must be $b^2-d^2$. – ccorn Oct 11 '14 at 23:08

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.