Determine all integer pairs #(x,y)# with #x < y# such that the sum of all the integers strictly contained between then is equal #2016#?

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 #y - x - 1# and the average term is #(x+y)/2#

So we have:

#(y-x-1)((x+y)/2) = 2016#

So:

#(y-x-1)(x+y) = 4032#

The prime factorisation of #4032# is:

#4032 = 2^6*3^2*7#

So there are #(6+1)(2+1)(1+1) = 7*3*2 = 42# positive integer factors:

If #x+y = n# for one of these factors, then:

#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 #n+-(4032/n+1)# is even.

Hence one of #n# and #4032/n# is odd and the other even. Thus one must be a multiple of #2^6# and the other odd.

Hence the possible values for #n# are:

#1, 3, 7, 9, 21, 63, 64, 192, 448, 576, 1344, 4032#

with corresponding #(x, y)# pairs:

#(-2016, 2017), (-671, 674), (-285, 292), (-220, 229), (-86, 107), (-1, 64), (0, 64), (85, 107), (219, 229), (284, 292), (670, 674), (2015, 2017)#