This is tricky...

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 :-

149 140 105 104

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.

1 solution

Since 100 = 1 + ( 34 1 ) 3 100 = 1 + (34 - 1)*3 we know that there are 34 34 terms in the A.P..

Now the 19 19 th term is 1 + ( 19 1 ) 3 = 55 1 + (19 - 1)*3 = 55 . If A A were the set of the first 19 19 terms of the A.P. then the largest possible sum would be 55 + 52 = 107 55 + 52 = 107 , and the next largest would be 55 + 49 = 104 55 + 49 = 104 . So 104 104 is the only possible answer of the options given.

Now we need to show that for any A A there will be two elements that sum to 104 104 . Now two terms a m = 1 + ( m 1 ) 3 a_{m} = 1 + (m - 1)*3 and a n = 1 + ( n 1 ) 3 a_{n} = 1 + (n - 1)*3 will sum to 104 104 if

a m + a n = 2 + 3 ( m + n 2 ) = 3 ( m + n ) 4 = 104 m + n = 36 a_{m} + a_{n} = 2 + 3*(m + n - 2) = 3*(m + n) - 4 = 104 \Longrightarrow m + n = 36 .

Without loss of generality let m < n m \lt n .Now since m , n 34 m, n \le 34 and must be distinct, there are 16 16 possible pairs ( m , n ) (m,n) such that m + n = 36 m + n = 36 . These are ( 2 , 34 ) , ( 3 , 33 ) , ( 4 , 32 ) , . . . . . . . , ( 16 , 20 ) , ( 17 , 19 ) (2, 34), (3, 33), (4, 32), ....... , (16, 20), (17, 19) . The only values that cannot be part of a pair are 1 1 and 18 18 . So we can choose one value from each of the 16 16 pairs along with 1 1 and 18 18 and not have a pair of elements that add to 36 36 , but the next value we choose will necessarily "complete" one of the 16 16 pairs, (by the Pigeonhole Principle).

Thus for any set of 19 19 distinct integers chosen from the given A.P. there must be a pair of elements that add to 104 104 .

Sir, in your solution your proof in based on the answer itself. What if you didn't know what the answer was, what would then be your approach to solve this problem?

Sarthak Pal - 6 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...