@bodhi_vriksha said:This one is today'sQuantitative Question of the Day (QQAD). Let's see how many of you are up for this challenge.Let A be a subset of {1, 2, 3, ... , 27} such that no two subsets of A have the same sum. What is the largest possible sum for A?(1) 101 (2) 121 (3)129 (4) 135 (5) none of theseThis problem will also be flashed on our FB page. Team BV -Vineet
Solution:
To find A with sum of the elements having max sum, we can start with 27 and 26 safely. 25 can also be taken without any harm. Now, 27 = 27, 26 = 27-1, 25 = 27-2. The next number will be 27-4 as if next were 27-3, then 27-3 + 27 = 27-1 + 27-2 [condition violated]. Now, we have 4 numbers with us.
Each of the next number below 27-4 i.e. 27-5 can't be in our set as 27-5 + 27 = 27-1 + 27-4, 27-6 can't also be there as 27-6 + 27 = 27-2 + 27-4. But we have no such problems with 27-7. The set till now is {27, 26, 25, 23, 20}.
Thus -> 0, 1, 2, 4, 7 became seed (for the namesake) elements which needed to be subtracted from 27.
The next seed element will be 13 as any number between [8, 12] will violate condition. e.g. 8+0 = 7+1 or 11+0+1 = 7+4+1 or 12+0+1=2+4+7-> note that we must have same number of summands on either side to do this kind of generation.
Any new element 27-x, where x > 13 can be combined with some of the elements in {27, 26, 25, 23, 20, 14} whose sum will be equal to some of the rest elements
.
The initial few seed elements can be found out to be 0, 1, 2, 4, 7, 13, 24, 46, 86.
=> Choice (4) is the right answer
Team BV - Vineet