A triangular number t n is defined as
t n = t n − 1 + n , t 1 = 1
Is it true that there are infinitely many triangular numbers that are sum of two other triangular numbers?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Yes.
The following identity is true
t x = t y + t z
where x = n ( n + 3 ) / 2 + 1 , y = n + 1 and z = n ( n + 3 ) / 2
Will you please show how this identity is proved?
Problem Loading...
Note Loading...
Set Loading...
Any time n itself is a triangular number, the identity t n = t n − 1 + n is an example of a triangular number that is the sum of two other triangular numbers. (eg when n = 6 , we have 1 5 + 6 = 2 1 , and so on)