Mr.Calvin takes out an even number from the set .
Suppose that the remaining set has precisely 124 subsets with three elements that form an arithmetic progression .
Find the sum of the possible values of the number is removed.
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.
If a , b , c form an arithmetic progression of integers, then a and c have the same parity. Moreover, any two numbers a , c of the same parity can be the first and third elements of an arithmetic progression of integers. Thus there are ( 2 1 3 ) + ( 2 1 2 ) = 1 4 4 triplets of numbers between 1 and 2 5 that form an arithmetic progression.
For any even number x , there are 1 1 triplets that form an arithmetic progression where x is either the first or the third element (just choose another even number to be the other terminal integer). There are also m i n ( x − 1 , 2 5 − x ) (the smaller of the numbers of integers less than or greater than x ) triplets that form an arithmetic progression where x is the second element.
Thus there are 1 4 4 − 1 1 − min ( x , 2 5 − x ) = 1 3 3 − m i n ( x , 2 5 − x ) triplets that can be chosen that form an arithmetic progression and do not contain x (for any even number x ). Thus we obtain 1 2 2 such triplets when x = 1 0 , 1 6 , making the answer 1 0 + 1 6 = 2 6 .
It is interesting to note that the solutions for any possible number of triplets (and not just 1 2 2 ) are of the form x , 2 6 − x and so add to 2 6 .