Determine all integer pairs #(x,y)# with #x < y# such that the sum of all the integers strictly contained between then is equal #2016#?
1 Answer
Explanation:
The sum of an arithmetic sequence, such as an unbroken sequence of consecutive integers, is equal to the number of terms multiplied by the average term, which is also the average of the first and last terms.
In our example, the number of terms is
So we have:
#(y-x-1)((x+y)/2) = 2016#
So:
#(y-x-1)(x+y) = 4032#
The prime factorisation of
#4032 = 2^6*3^2*7#
So there are
If
#y - x - 1 = 4032/n#
So:
#x = 1/2(n-4032/n-1)#
#y = 1/2(n+4032/n+1)#
So the only additional requirement is that
Hence one of
Hence the possible values for
#1, 3, 7, 9, 21, 63, 64, 192, 448, 576, 1344, 4032#
with corresponding
#(-2016, 2017), (-671, 674), (-285, 292), (-220, 229), (-86, 107), (-1, 64), (0, 64), (85, 107), (219, 229), (284, 292), (670, 674), (2015, 2017)#