a certain city with a population of 108,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 ?
"let x = number of people in smallest district x * 1.1 = number of people in largest district x will be minimised when the number of people in largest district is maximised 10 * x * 1.1 = 11 x = total number of people in other districts so we have 11 x + x = 108 k x = 9,000 answer : c"
multiply(multiply(const_4, const_2), const_100)