Did you know? Seven school teams can play every other team exactly once in just seven rounds—but only if someone deliberately plans the rest periods. It is surprisingly easy to produce a timetable with twenty-one match slots that still repeats one pairing and accidentally omits another. Counting matches is the beginning of the problem; proving that the schedule is complete is the real mathematical learning.
A single round-robin tournament means every pair of different teams meets exactly once. With seven teams, that creates 7 × 6 ÷ 2 = 21 different matches. At most three matches can be played at the same time, because six teams play and the seventh has a bye. A correctly planned event therefore needs seven rounds if there are enough playing spaces for three simultaneous games. Each team plays six matches and rests exactly once.
This is an original, fictional planning example for students, tutors, PE teachers and parents. We will distinguish the number of matches, the number of rounds, court capacity, fairness and the final independent check. The timetable is illustrative rather than a report of a real school competition; actual organisers must also account for venue availability, rules, supervision, accessibility and rest.
First diagnose the misunderstanding: a match is not a round
Ask a learner: “Seven teams each meet six opponents. Is the answer forty-two matches?” The multiplication 7 × 6 = 42 counts each encounter twice: A against B appears once in A’s opponent list and once in B’s. For a competition where A–B and B–A mean the same single match, the total must be halved. The formula n(n − 1)/2 counts unordered pairs of n distinct teams; for n = 7 it is 21.
Next ask what a round means. A round is a set of matches played in one time slot, not one match. If the event has three courts, it can run three games simultaneously. If only one court is available, those same 21 matches require at least 21 separate court slots even though the pairing plan can still be grouped into seven logical rounds. A formula does not provide a timetable until resources and constraints are named.
There is a second common error: seven is odd, so a teacher may try to pair all seven teams every round. That is impossible when teams play at most one match simultaneously, because each game consumes two teams. One team must sit out each round. This rest is called a bye; it is not an extra victory or a forgotten match.
Worked example: the seven-team after-school tournament
Suppose seven fictional teams are labelled A, B, C, D, E, F and G. They can play on three courts at once. We assume no team plays two matches in one round, every encounter is a single game, court conditions are equivalent for this exercise and the organiser wants one bye per team. None of the numbers below imply an actual school’s sporting timetable.
The first check is arithmetic. Each team faces six opponents, giving 7 × 6 = 42 team appearances across match records. Each match has exactly two team appearances, so 42 ÷ 2 = 21 matches. Seven rounds times three matches per round also equals 21. These are two independent routes to the same total, but matching totals alone will not detect a repeated pair.
A complete seven-round schedule that can be independently audited
- Round 1: B–G, C–F, D–E; bye: A.
- Round 2: A–G, B–E, C–D; bye: F.
- Round 3: A–F, G–E, B–C; bye: D.
- Round 4: A–E, F–D, G–C; bye: B.
- Round 5: A–D, E–C, F–B; bye: G.
- Round 6: A–C, D–B, F–G; bye: E.
- Round 7: A–B, D–G, E–F; bye: C.
Read the schedule as three pairings and one idle team per round, not as seven uninterrupted periods without breaks. The bye sequence A, F, D, B, G, E, C contains every team once. Team A’s fixtures, for example, are against G, F, E, D, C and B in rounds 2 to 7. Every other team similarly meets each of its six opponents once.
For a simple audit, rewrite every fixture with the team letters in alphabetical order and tick it on a triangular pairing grid. The possible pairs beginning with A are AB, AC, AD, AE, AF and AG (six). Beginning with B, excluding A, are BC, BD, BE, BF and BG (five). Continue with C (four), D (three), E (two) and F (one). The totals 6 + 5 + 4 + 3 + 2 + 1 = 21. If any cell is blank, the timetable misses a fixture; if a cell is ticked twice, a pair repeats.
Why the circle method works—and what it does not promise
The NRICH University of Cambridge Millennium Mathematics Project’s tournament-scheduling discussion gives systematic arrangements for odd and even numbers of competitors. A practical classroom version is to add a dummy eighth entry labelled BYE, pair opposite positions, keep one position fixed and rotate the other seven positions each round. A team paired with BYE rests. Because a full rotation changes partners systematically, each real team eventually meets the other six.
The method constructs pairings, but it does not magically solve every operational question. It does not decide which court is accessible, whether afternoon rain affects a venue, whether a team is playing immediately after a strenuous game or whether two teams share equipment. Students should label those constraints separately rather than pretend a mathematically complete schedule is automatically safe, equitable or ready to publish.
Counting rounds is a different calculation
With seven teams, each of the seven rounds contains floor(7/2) = 3 matches and one bye. So 7 × 3 = 21 matches. With eight teams, there can be four games per round and each team plays seven opponents, giving 8 × 7 ÷ 2 = 28 matches over seven rounds. There is no bye because the team count is even. With nine teams, nine rounds with four matches and one bye per round produce 36 matches.
Notice a small but important distinction. A seven-team competition with only two functioning courts cannot fit three games into one simultaneous time slot. The event still has 21 matches, but must use at least ceil(21/2) = 11 court slots if every slot can accommodate two matches; practical sequencing may require more. It would be misleading to claim that the tournament has seven clock-time sessions without accounting for this court bottleneck.
A transfer question: what if every pair plays twice?
Suppose each pairing must be played once at each team’s home venue. This is a double round-robin, with a home and away fixture for every unordered pair, so 21 × 2 = 42 matches. Each team now plays twelve games. If the timetable keeps the pattern of three simultaneous games and one bye per round, fourteen rounds accommodate those matches. Whether home venues can host simultaneous matches is an additional resource constraint.
Here is a useful mathematical trap. A learner who says “n(n − 1)/2 always gives the total” has forgotten that the formula counts each pair once. Ask them to identify exactly what counts as a distinct match. That interpretation comes before the formula, just as understanding a per-ticket fee comes before an algebraic expression.
Learner diagnostic: three quick questions before any formula
- Question A: Four teams each play the other three once. Is the answer six games or twelve? Correct reasoning: four lists of three appearances give twelve team appearances; divide by two for six different matches.
- Question B: Five teams have two courts. How many simultaneous matches fit in one round? Two; one team must have a bye. Five rounds of two matches cover ten distinct matches.
- Question C: A fixture list contains A–B and B–A on separate lines but promises each pair meets once. Is that valid? Not without some separate distinction such as home/away legs. Under the stated single-round-robin rule it is a duplicate.
These checks reveal different difficulties. A learner who writes twelve in Question A may double-count. Someone who answers three games in Question B is ignoring the odd-team constraint. Someone who accepts the duplicated pair in Question C may be counting timetable lines without understanding the event’s rules. The response should be different for each diagnosis.
Practice ladder: model, guide, remove support, then transfer
Stage 1: visible pairs
Use three paper cards A, B and C. Ask students to lay out all different two-card pairings: AB, AC and BC. Turn over one card and show why BA is not a new pairing in a single meeting. This concrete model is particularly useful when the formula looks mysterious.
Stage 2: guided list and grid
Move to five teams. Write the possible unordered pairs in a triangular grid, then invite the learner to find ten unique matches and design five rounds with two fixtures and one bye. One valid schedule can be checked by counting matches and tracing each team’s opponent list.
Stage 3: hide the model
Present six teams without displaying the previous grid. Learners should predict fifteen matches, five rounds and three simultaneous games per round, assuming three courts. They should then construct or verify a fixture list, not just supply the numeric totals. Give feedback about omissions and repetitions before moving to larger numbers.
Stage 4: change the constraints
Ask: “Seven teams, three courts, two games per pair—how many matches and rounds? What changes if one court closes?” The complete home-and-away pairing plan has 42 games. Fourteen rounds are enough with three courts, but the lost court changes the number of simultaneous playing slots that can be accommodated. A student who can distinguish pair count from venue capacity has transferred the underlying model.
What teachers, pupils and parents can do next
For a teacher planning a classroom mini-event, post the rules above the fixtures: number of teams, once or twice per opponent, simultaneous courts, bye policy and how postponed games are handled. Invite students to check a schedule anonymously against a pairing grid. This develops combinations, proof by double-counting and a habit of checking a proposed plan independently.
For a pupil practising at home, draw a seven-vertex diagram and connect each unordered pair once, or make a triangle list with decreasing counts. A parent can ask which evidence proves the schedule is complete. The pupil should be able to explain the 21 and identify every team’s six opponents without looking at a provided answer.
For an organiser, keep a simple audit log with columns for round, court, team one, team two, bye and completion status. When a match is postponed, mark it not played; do not create an invented result. Rearranging a time slot should not quietly duplicate the fixture or alter its single-versus-double format.
Observe progress: do not confuse a correct total with a correct plan
A useful progress record can track four observable actions: the learner explains why pairs are divided by two; correctly calculates total games; identifies odd-team byes; and checks a newly constructed fixture list for missing and duplicated opponents. Mark whether each action was completed with a worked example visible, with a hint or independently. On another day, retest using five or nine teams, not the identical seven-team sheet.
There is no basis to guarantee better test grades from this single task. The point is to turn a real planning question into a transferable habit: define the object being counted, identify constraints, construct a candidate solution, check every case and revise what fails.
Frequently asked questions
Can a seven-team tournament finish in six rounds if we have extra courts?
Not if every team must meet six different opponents and can play only once per round. Each individual team needs six playing rounds, but the odd number means each round has a bye; seven rounds are necessary for everyone to get their turn resting. Extra courts cannot remove the need to have an even number of players in a simultaneous match.
Does a bye count as a win?
Not automatically. In this illustrative schedule a bye is a rest, not a played game. Competitions sometimes have their own points rules; those must be stated separately, and an unplayed match must never be silently recorded as a win unless the published rules expressly call for it.
Why not just multiply seven by six?
Because that counts team appearances: one appearance for each side of each encounter. To count each unordered pair once, divide by two. If the contest deliberately has two distinct home/away games per pair, the match total becomes 42 for seven teams.
Can we use this for debates or chess instead of sport?
Yes, if every distinct pair meets once and the activity permits the specified simultaneous schedule. But activity-specific requirements—duration, room, supervision, rest, judge availability and tie rules—still matter.
Keep the real aim in view
The heart of this lesson is not the number twenty-one. It is learning to explain what was counted, why it was counted once, and how to verify a schedule that others will rely on. For related practice, compare planning school group projects with dependent tasks, then use independent rechecking of worked examples to test genuine transfer.
Explore the eduKate Education Hub for connected learning routes. Our immutable Secondary 1 Mathematics small-group tutorial reference illustrates the wider teaching principle: diagnose first, make reasoning visible, practise progressively and invite learners to check their own work.