Did you know? A candidate can lead on first-choice votes in a classroom election and still not win after every valid next preference is counted. That need not be a counting error. It may be the result of the class’s chosen voting rule. The mathematical skill is to trace each ballot once per round, keep totals balanced and report the rule clearly enough for somebody else to reproduce the result.
In a single-winner ranked-choice count, students order candidates by preference. Each active ballot counts for the highest-ranked candidate still in the contest; if no candidate has a majority, the lowest candidate is removed and that candidate’s ballots can move to their next continuing choice. Our fictional example defines a majority as strictly more than half of active votes and uses one elimination at a time. A school must agree on validity, exhausted ballots and tie procedures before voting, not invent them when results are known.
This article is a mathematics and responsible-participation lesson, not a report of a real class election or a recommendation about political candidates. We will solve a fully invented fifteen-ballot election, check its arithmetic, explain why the transfer is not a second vote, develop guided-to-independent practice and discuss fair handling of privacy and ambiguous ballots.
Begin with the question that detects the real misconception
Show a student the phrase “second choice receives a vote after the first choice is eliminated.” Ask whether each voter gets two votes at once. The answer is no. The ballot represents one continuing preference in each count, not a pile of separate votes for all marked names. The student’s difficulty may be understanding time and sequence, rather than calculating percentages.
A second diagnostic: “If candidate A leads in first-choice votes, must A win?” Not under every counting rule. A lead is different from a majority. If more than half of the continuing ballots count for A in the first round, A wins under the rule defined here. Otherwise the lowest candidate may be eliminated and next preferences can change the totals.
An authoritative explanation of the broad mechanism appears in the City of Portland’s guide to single-winner and multi-winner ranked-choice counts. The classroom exercise below concerns one representative, not the different multi-winner proportional method. It does not claim Singapore schools use this system or that an actual school must adopt it.
State the classroom rules before opening any ballots
- One seat: the class chooses one fictional representative from candidates A, B and C.
- Ranking: a voter may rank the candidates in strict order. No candidate can be listed twice on the same ballot.
- First round: count each valid ballot for its top continuing choice only.
- Majority: the winner needs more than half of the active ballots in that round.
- No majority: eliminate the candidate with the fewest active votes and transfer their ballots to each voter’s next continuing choice.
- Privacy and disputes: use anonymous ballots, announce what makes a ballot invalid or exhausted, and publish an impartial tie rule before votes are cast.
The particular validation and tie procedures must match the school’s own approved policy if this is a real election. Some election systems have detailed rules for skipped ranks, overvotes, ties, write-ins and exhausted ballots. Our exercise uses unambiguous complete rankings so that the calculation, not a contested policy detail, is the focus. It should never be presented as a legal description of elections in Singapore.
Worked example: fifteen fictional ballots
Assume fifteen eligible participants each submit one valid ballot, and all ballots list a usable next preference among the three candidates. The initial count is A: 6, B: 5, C: 4. Check the total: 6 + 5 + 4 = 15. With fifteen active votes, half is 7.5 and an integer majority needs at least 8 votes. Nobody reaches eight, so the count proceeds.
C has the fewest first-choice votes, four, and is eliminated under the previously stated rule. Look at the next continuing preferences on exactly those four ballots. In this invented set, one has A as the next preference and three have B. The other eleven ballots already counting for A or B stay with their current candidates.
- Before transfer: A has 6; B has 5; C has 4; total active votes = 15.
- Eliminate C: C has 0 continuing votes after removal.
- Transfer C’s four ballots: 1 goes to A; 3 go to B.
- After transfer: A = 6 + 1 = 7; B = 5 + 3 = 8.
- Audit: 7 + 8 = 15 continuing votes. Every valid ballot is still counted exactly once.
- Decision: B has 8 out of 15 active votes, greater than half, and wins under the stated fictional rule.
What happened? A led at the start by six votes to B’s five, but B became the winner after the preferences of C’s voters were counted. The total did not become nineteen. Moving four ballots does not create four new voters. The initial fifteen ballots remained fifteen, and the preferences shifted where those ballots were counted.
A useful cross-check is to track changes as a conservation equation. C loses four continuing votes while A gains one and B gains three; the total change is −4 + 1 + 3 = 0. The numbers make sense because no ballot is exhausted in this main example. This is a more convincing explanation than simply copying the final totals from a spreadsheet.
Why a ballot transfer is not “two votes for one pupil”
Imagine a single fictional ballot written “C first; B second; A third.” During the first count it contributes one vote to C. When C is eliminated, it contributes one vote to B instead. It never gives one vote to C and one to B simultaneously. If B remains active, the ballot does not skip B to A just because A was initially ahead.
The student can draw three boxes labelled A, B and C, with fifteen counters representing ballots. Move the four counters from C according to their marked next active preferences. No new counters are added to the table. Physical counters make the conservation principle visible before the student moves to the abstract table.
This is not identical to simply asking everybody to vote again. The next preferences were already expressed on the original ballots. The method chosen by the class determines how those preferences are considered. Different voting methods can produce different results from the same underlying rankings; describing a result therefore requires naming the method.
A second case: what if a ballot runs out of usable preferences?
Now change the invented example for practice. Keep A: 6, B: 5 and C: 4 at the start, but assume that among C’s four ballots, one ranks A next, two rank B next and one ranks no continuing candidate. The final ballot is exhausted after C is eliminated: it can no longer count for a candidate under this classroom rule.
The second round now has A = 7 and B = 7, with 14 active ballots and one exhausted ballot. The check is 7 + 7 + 1 = 15 original valid ballots. A majority of fourteen active ballots would require at least eight; neither candidate has it. The count is tied and the organiser must use the tie procedure published before the contest. It would be wrong to quietly hand the extra vote to a favoured candidate or pretend the exhausted ballot never existed.
This extension reveals why a vague statement like “fifteen pupils voted, so the winner always needs eight” can become incomplete under a rule based on active ballots. If ballots stop having usable preferences, the active denominator may change. The class should record original ballots, active ballots and exhausted ballots separately, with the threshold for each round plainly labelled.
The table pupils should maintain in every counting round
- Round number: identify the current count and any candidate just eliminated.
- Candidate totals: write one whole-number total for each continuing candidate.
- Transfers: record how many ballots move from the eliminated candidate to each continuing option.
- Exhausted: record ballots with no usable continuing preference under the declared rule.
- Reconciliation: candidate totals plus exhausted ballots must equal the valid original ballots, absent a clearly documented invalidation rule.
- Threshold and decision: state the number of active ballots and the strictly-more-than-half threshold for a winner.
Students sometimes check only whether the winner has the highest number. That is incomplete if the stated rule requires a majority. A candidate with seven votes out of fifteen is leading only if the others have fewer; seven is not a majority of fifteen. A transparent table prevents the terms “highest,” “majority,” “active” and “original” from being used interchangeably.
Four common errors and the precise teaching response
Error 1: count every ranking as a vote
If the learner says fifteen ballots ranking up to three candidates means forty-five votes, use counters. Each ballot is represented once in every round. Additional rankings specify where the ballot could go later, not extra simultaneous weight.
Error 2: discard the eliminated candidate’s ballots
A student might say A wins because C is removed and A has six votes to B’s five. Ask them to read the four C ballots again and find each voter’s next continuing preference. Eliminating a candidate does not automatically eliminate every ballot that ranked them.
Error 3: use a fixed majority denominator without inspecting exhaustion
Contrast the fifteen-active-ballot worked example with the fourteen-active-ballot tie extension. The published counting rules determine the denominator. Teach pupils to write the denominator beside the percentage or fraction before comparing it with half.
Error 4: settle a tie by personal preference
If a student invents an ad hoc tie break once they see A and B tied, ask what rule a neutral organiser would have published before seeing the ballot count. A fair process requires that the same predeclared rule apply regardless of which names are tied.
Progressive practice: from visible tokens to independent auditing
Step 1: guided count with three voters
Provide three simple invented ballots: A–B–C, B–C–A and C–A–B. Ask pupils to put one counter in each first-choice pile. No candidate has a strict majority, and all three have one vote. The exercise is not asking pupils to choose a winner: it is asking them to recognise a tie and the need for a previously stated tie rule.
Step 2: model a transfer without changing total ballots
Give five ballots with first choices A: 2, B: 2 and C: 1, and stipulate that C’s one voter ranked B next. After eliminating C, B has three, A has two and the total remains five. Ask which physical counter moved; ensure the pupil does not draw a sixth counter.
Step 3: hide the worked table
Now return to the fifteen-ballot example without showing the solution. The learner should calculate the majority threshold of eight, identify C as lowest, apply one transfer to A and three to B, and demonstrate 7 + 8 = 15. Require an explanation of why B’s five first-choice votes were not the final figure.
Step 4: transfer to an exhausted-ballot case
Use the modified case with A seven, B seven, one exhausted ballot and fourteen active ballots. Ask for the correct denominator, the threshold, the correct accounting of fifteen original ballots and why no winner can be declared from these numbers alone. The learner should be able to explain the tie without guessing a result.
Step 5: review a flawed spreadsheet
Give students a fictional tally sheet that adds transfers to the winner’s total but fails to subtract them from the eliminated candidate. Ask which reconciliation fails and how to repair it. This makes the audit meaningful: arithmetic is used to test a decision-making record.
Parent and teacher guidance: protect trust as well as arithmetic
A school teacher can run the lesson with invented ballots before any actual class vote. If using real ballots, follow the school’s policies on approval, privacy, validity, consent and record retention. Do not photograph identifiable pupil choices, post named ballot histories, or invite pupils to interrogate how someone voted. The educational task is an impartial counting method, not pressure to disclose preferences.
A parent can ask a child to explain one counter moving from C to B, to verify that the total remains fifteen and to state why eight votes is a strict majority when fifteen ballots remain active. If the child answers after seeing the worked table, try a changed five-ballot example independently on another day.
For an audit, use anonymous identifiers or aggregate groups. If a spreadsheet is used, check that each ballot identifier appears only once and that formulas do not count a transferred ballot twice. The Core Aim guide to detecting duplicate classroom survey responses provides a related habit: inspect data integrity without making unsupported claims about real pupils.
How to measure understanding rather than just correct outcomes
Record whether a pupil can state the rule, count first choices, calculate a strict majority, transfer eligible ballots, reconcile original and active totals, and flag a tie or ambiguous ballot. Each can be marked as modelled, prompted or independent. A student who reaches the right winner after double-counting the total has not yet shown a trustworthy method.
A follow-up assessment can change the candidate names, ballot totals and the number of exhausted preferences while preserving the core structure. Look for the student’s ability to identify exactly which assumptions changed. This task should develop transparency and mathematical reasoning, not be sold as proof of improved school grades or political judgment.
Frequently asked questions
Is this the official way every class or country elects representatives?
No. This is a defined single-winner ranked-choice teaching model. Different schools and jurisdictions choose different election methods and may apply different validation, tie and exhausted-ballot rules. A real contest follows its governing rules, not this fictional classroom example.
Why can the first-choice leader lose?
Because the first-choice leader may lack a strict majority. When the lowest candidate is eliminated, the next preferences on those ballots can allow a different remaining candidate to obtain a majority under the declared transfer rule.
What happens if a pupil ranks only one candidate?
Their ballot can initially count for that candidate under the simplified model. If that candidate is later eliminated and there is no usable continuing preference, the ballot becomes exhausted. Whether and how this is handled in a real election depends on the actual rules.
Does ranking three candidates mean one pupil has three votes?
No. A ranked ballot expresses preferences, but under the described single-winner system it counts for one continuing candidate at a time. Transfers move that contribution; they do not multiply it.
Can two remaining candidates tie?
Yes, as the second fictional case demonstrates. The organiser needs a predeclared, permitted tie-resolution rule. The arithmetic alone cannot justify an arbitrary choice.
Should students debate which candidate ought to win?
They may discuss competing methods or democratic fairness respectfully if appropriate to their learning context, but checking a count is different from campaigning. The worked arithmetic should remain independent of personal preferences about candidates.
The educational point: fair procedures require checkable reasoning
The deeper lesson is that a defensible answer is not only the final name. It is the chain of decisions: define the rule in advance, count each valid ballot once per round, preserve transfers and exhaustion honestly, verify the denominator, and explain the result without changing the rules afterwards. That is mathematics in service of clear, responsible action.
For another lesson in rule clarity, see how to repair a multiple-choice question with two defensible answers. Explore the eduKate Education Hub and the immutable Secondary 1 Mathematics tutorial reference, where diagnosis, visible reasoning, progressive practice and independent checks form the teaching floor.