A certain city with a population of 132,000 is to be divided into 11 voting districts, and no district is to have a population that is more than 10 percent greater than the population of any other district. What is the minimum possible population that the least populated district could have?
(A) 10,700
(B) 10,800
(C) 10,900
(D) 11,000
(E) 11,100
We can plug in the answer choices, which represent the minimum possible population.
To MINIMIZE the smallest population, we need to MAXIMIZE the other 10 populations.
Thus, each of the other 10 districts must have the maximum allowed population: 10% greater than the smallest population.
Since the total population of the city is 132,000 -- a multiple of 1,000 -- the correct answer choice is almost certainly a multiple of 1,000.
Answer choice D: 11,000.
Each of the other 10 districts = (132,000 - 11,000)/10 = 12,100.
Difference between the populations = 12,100 - 11,000 = 1100, which is 10% of the smallest population.
Success!
The correct answer is
D.
Algebraically:
Let x = the population of the least populated district.
As noted above, to MINIMIZE the smallest population, we need to MAXIMIZE the other 10 populations.
Thus, each of the other 10 districts must have the maximum allowed population:
10% greater than the smallest population = 1.1x.
Thus, the sum of the populations in the other 10 districts = 10(1.1x) = 11x.
Since the sum of ALL the populations is equal to 132,000, we get:
x + 11x = 132,000
12x = 132,000
x = 11,000.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at
[email protected].
Student Review #1
Student Review #2
Student Review #3
