I've received this grade school math problem but unfortunately algebra cannot be used. I am somewhat stumped and not convinced with my own answers. Here goes:
At a grade school election, there were 1080 voters. 5 students are running to be officers however there are only 3 seats available. What is the minimum number of votes needed to guarantee a seat?
Assume that everyone votes and that each person can only vote once. I also think the voting system might be culturally different, so the way it works here is that the 3 people with the highest votes are automatically officers. Basically the 1080 votes are spread over the 5 candidates, only the highest 3 are guaranteed positions.
I would appreciate both algebraic and non-algebraic answers.
Thank you very much!