Find the smallest positive integer such that and are 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.
Let i , j be positive integers such that n + 2 0 1 5 = 2 i 2 + i and n − 2 0 1 5 = 2 j 2 + j . Note that this implies that i > j . If we subtract the second equation from the first, we get
( n + 2 0 1 5 ) − ( n − 2 0 1 5 ) 4 0 3 0 8 0 6 0 8 0 6 0 8 0 6 0 = 2 i 2 + i − 2 j 2 + j = 2 i 2 + i − j 2 − j = i 2 − j 2 + i − j = ( i + j ) ( i − j ) + i − j = ( i + j + 1 ) ( i − j ) .
In order to minimize n , we must let the "gap" between i + j + 1 and i − j be as small as possible. Also, one of the expressions must be a multiple of 4 , since they have different parities and 8 0 6 0 has a factor of 4 . Finally, i + j + 1 > i − j because i and j are positive. i + j + 1 = 1 2 4 and i − j = 6 5 is the setting we seek. Solving this gives j = 2 9 , so
n = 2 2 9 2 + 2 9 + 2 0 1 5 = 4 3 5 + 2 0 1 5 = 2 4 5 0 .