Key aspects of the question
- There are 7 people including larry who have the same number of awards
- The other two can have any number of awards subject to the statements
- Since we are dealing with awards and people the numbers have to be integer
Let x be the number of awards for the 7 people, a and b for the other two
From the question stem we gather that 7x + a + b = 64
Now statement 1 simply means that the max number of awards any person can have is 2x
Hence lets try maximizing a and b
So we ll get 7x + 2x + 2x = 64
11x = 64 i.e x = 64/11 ---> from here you ll get a hint that the start point of testing values can be 5
So lets say that Larry has 5 awards
5 x 7 = 35 + 10 + 10 (10 is the max number of awards for the other people) this equals 55 which is < 64 hence this doesnt work
Lets say Larry has 6 awards
7 x 6 = 42 , a + b can be 11 + 11 ---> since these values are within constraints they can work
Lets say that larry has 7 awards
7 x 7 = 49, a + b can be 6 and 9 ---> since within constraints ---> this can work
Since we have two answers i.e 6 and 7 ---> not sufficient
Statement 2
Larry = 6 can work if say a + b is 5 + 17
Larry = 7 can work as shown above
When you combine notice that larry = 6 will not work cause there is a constraint in statement 1 which say that the max number of awards any one can have is 2x
Hence answer is C and larry has 7 awards