Triangular numbers are a sum of all integers from 1 to n.
Square numbers are an integer multiplied by itself.
How many numbers are there that are both triangular and square?
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.
N k = ( 4 2 ( 3 + 2 2 ) k − ( 3 − 2 2 ) k ) 2 . This formula gives each square triangular number and as it can take any k , there must be an infinite amount
Problem Loading...
Note Loading...
Set Loading...
The number N is square are triangular provided that N = 2 1 n ( n + 1 ) = m 2 for some positive integers n , m . Thus we require ( 2 n + 1 ) 2 − 2 ( 2 m ) 2 = 1 The positive integer solutions x , y of Pell's equation x 2 − 2 y 2 = 1 are given by the formula x k + y k 2 = ( 1 + 2 ) 2 k = ( 3 + 2 2 ) k k ∈ N Since x 1 = 3 is odd, y 1 = 2 is even, and since x k + 1 = 3 x k + 4 y k y k + 1 = 2 x k + 3 y k we deduce by induction that x k is always odd and y k always even. Now ( 3 + 2 2 ) k = x k + y k 2 ( 3 − 2 2 ) k = x k − y k 2 so that y k = 2 2 ( 3 + 2 2 ) k − ( 3 − 2 2 ) k and hence N k = 4 1 y k 2 = ( 4 2 ( 3 + 2 2 ) k − ( 3 − 2 2 ) k ) 2 is a square and triangular number for any positive integer k .