Editing Highest averages method (section)

=== Min-Max inequality ===
Every divisor method can be defined using the min-max inequality. Letting brackets denote array indexing, an allocation is valid if-and-only-if:'''<ref name="Pukelsheim-2017-1" />'''{{Rp|78–81}}<blockquote>{{Math|max {{sfrac|votes[party]  | post(seats[party])}} ≤ min {{sfrac|votes[party] | post(seats[party]+1)}}}}</blockquote>In other words, it is impossible to lower the highest vote average by reassigning a seat from one party to another. Every number in this range is a possible divisor. If the inequality is strict, the solution is unique; otherwise, there is an exactly tied vote in the final apportionment stage.'''<ref name="Pukelsheim-2017-1" />{{Rp|83}}'''