Let A be any set of 19 distinct integers chosen from the AP 1 ,4, 7, 10, ... 100. Then there must be two distinct integers in A whose sum is :-
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.
Since 1 0 0 = 1 + ( 3 4 − 1 ) ∗ 3 we know that there are 3 4 terms in the A.P..
Now the 1 9 th term is 1 + ( 1 9 − 1 ) ∗ 3 = 5 5 . If A were the set of the first 1 9 terms of the A.P. then the largest possible sum would be 5 5 + 5 2 = 1 0 7 , and the next largest would be 5 5 + 4 9 = 1 0 4 . So 1 0 4 is the only possible answer of the options given.
Now we need to show that for any A there will be two elements that sum to 1 0 4 . Now two terms a m = 1 + ( m − 1 ) ∗ 3 and a n = 1 + ( n − 1 ) ∗ 3 will sum to 1 0 4 if
a m + a n = 2 + 3 ∗ ( m + n − 2 ) = 3 ∗ ( m + n ) − 4 = 1 0 4 ⟹ m + n = 3 6 .
Without loss of generality let m < n .Now since m , n ≤ 3 4 and must be distinct, there are 1 6 possible pairs ( m , n ) such that m + n = 3 6 . These are ( 2 , 3 4 ) , ( 3 , 3 3 ) , ( 4 , 3 2 ) , . . . . . . . , ( 1 6 , 2 0 ) , ( 1 7 , 1 9 ) . The only values that cannot be part of a pair are 1 and 1 8 . So we can choose one value from each of the 1 6 pairs along with 1 and 1 8 and not have a pair of elements that add to 3 6 , but the next value we choose will necessarily "complete" one of the 1 6 pairs, (by the Pigeonhole Principle).
Thus for any set of 1 9 distinct integers chosen from the given A.P. there must be a pair of elements that add to 1 0 4 .