Bunuel wrote:
There were 5 candidates (Alexa, Bill, Charlie, Dan, and Ernie) vying for student council, and 100 total votes were cast. Everyone received at least one vote, and no two candidates received the same number of votes. Alexa won the election with 40 votes, Bill came in 2nd, Charlie in 3rd, Dan in 4th, and Ernie in last. What is the greatest number of votes that Ernie could have received?
A. 12
B. 13
C. 14
D. 15
E. 16
Using options is the safest
Let us start with the option C.
If E is 16, the minimum possible values of D, C and B are 17, 18 and 19 => \(16+17+18+19+40\leq 100......110\leq 100\)..No
If you reduce E by 1, then total will become 110-4=106....No
If you reduce E further, then total will be 106-4=102.
Reduce E further by 1, => \(13+14+15+16+40\leq{100}.....98\leq 100\)...yes
Or
A+B+C+D+E=100
40+B+C+D+E=100
B+C+D+E=100-40=60
If we want to maximise the smallest, E, we have to take all values next to each other.
E+3+E+2+E+1+E=60......4E+6=60.....4E=54.....E=13.5
As E is an integer, E has to be 13.
B