Hovkial
'A' is the set of the first 100 positive integers. What is the minimum number of elements that should be picked from 'A' to ensure that at least one pair of numbers whose difference is 10 is picked?
(A) 11
(B) 20
(C) 51
(D) 55
(E) 60
Usually in GMAT when the question asks you to minimize/maximize something, we need to maximize/minimize something else to achieve that. We want to maximize our number of elements that do not have a difference of 10, to find the minimum number of elements required.
If we pick 1 in our list, then we should not include 11 in order to find more possible elements to include. Since 11 is not in the list, we can include 21 but including 21 means we don't want 31 in the list. Therefore extrapolating this way we have 1, 21, 41, 61, 81 in the list of "elements that do not have a difference of 10". We can do this for all numbers 1~10 and we have 5*10 = 50 numbers we can include out of the 100, and none of them have a difference of exactly 10.
Finally, the next number is 11 which we can't include. We inevitably already reached the point where any extra number will be 10 higher or lower than some number already in this list, therefore 51 elements are needed.
Ans: C