Let us assume that candidate i receives ni votes.
Then clearly 100ni/x<ni-1
or rearranging x>100ni/ni-1......call this equation (1)
This is true for all i i=1,2.....27.
Furthermore 27ni<=x for atleast one ni.(i.e the least ni)....eqn 2
Weknow that y/y-1 is a decreaing fn of y, so if ni<=x/27, then
100ni/ni-1>100x/27/(x/27-1)
or x>100x/27/(x/27-1).
Solving we get x>127.
For x>127 but x<=133, we get ni>=5 from equation 1, which leads us to x>135....which means that no solutions exist for x>127 but x<=133.
For x=134 we get ni=4 from eqn1...which also satisfies eqn 2
We also find that the 26 candidates getting 4 votes and one candidate getting 30 votes satisfies the given condition.
Therefore answer is c)134.
Quote:
Originally Posted by Aarav ------------------------------------------------------ Quantitative Question # 041 ------------------------------------------------------ N people vote for one of 27 candidates. Each candidate's vote % is atleast one less than his/her number of votes. What is the smallest possible value of N?
(a) 108 (b) 127 (c) 134 (d) 162 (e) none of these |