A shipping clerk has five boxes, each weighing less than 100 kg. The clerk weighs the boxes in pairs, obtaining the following weights: 110, 112, 113, 114, 115, 116, 117, 118, 120, and 121 kg. What are the weights of the lightest and heaviest boxes?
A. 52 and 66
B. 54 and 64
C. 54 and 62
D. 56 and 60
E. 58 and 62
Bunuel KarishmaB Sajjad1994 GMATinsightCould you please share the solution for this?
Can we expect this question in the exam? Seems very lengthy!
My approach to the question:
1. Rule out D & E because based on the options -
In D, the greatest weight is 60, which is not possible since the greatest combination of 121 requires the other weight to be 61.
Rule out DIn E, the smallest weight is 58, which is not possible since the least combination of 110 requires the other weight to be 52.
Rule out C2. Now, trial and error for the remaining options -
Option A: Lowest 52 and Highest 66
-> For greatest combination of 121, the other number apart from 66 will be 55.
Taking 55 as another value, and summing up with lowest 52 - the sum is 107, which is not in the list.
Rule out A
Option B: Lowest 54 and Highest 64
-> For greatest combination of 121, the other number apart from 64 will be 57.
Taking 57 as another value, and summing up with lowest 54 - the sum is 111, which is not in the list.
Rule out BAfter ruling out everything, C is the option. To verify: Option C: Lowest 54 and Highest 62
-> For greatest combination of 121, the other number apart from 62 will be 59.
-> For least combination of 110, the other number apart from 54 is 56.
We have 4 weights already, taking 58 as other weight -> with trail and error to ensure the unit digit is in the given list, we end up with all the combinations from the list.