A certain city with a population of 1, 32,000, is divided into 11 voting districts, and no district is to have a population that is more than 10% greater than the population of any other district. What is the minimum possible population that the least populated district could have?
A) 10700
B) 10800
C) 10900
D) 11000
E) 11100
What is the quickest way to solve this?
[spoiler]I figured out that this is a Geometric Progression
Sum of N terms = a(r^n-1)/r-1
132000 = a(1.10^11 - 1) / 1.10-1 we need to find a (first term also the lowest term)
But solving 1.10^11 is complicated[/spoiler]
A) 10700
B) 10800
C) 10900
D) 11000
E) 11100
What is the quickest way to solve this?
[spoiler]I figured out that this is a Geometric Progression
Sum of N terms = a(r^n-1)/r-1
132000 = a(1.10^11 - 1) / 1.10-1 we need to find a (first term also the lowest term)
But solving 1.10^11 is complicated[/spoiler]
Success = Max(Hardwork) + Min(Luck)
