Q.What is a 'Bye'? How is the number of byes determined in a knock-out tournament?
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →A bye is a free pass to the next round without playing; the number of byes equals the next higher power of 2 minus the number of teams.
What is a Bye?
A bye is a privilege granted to certain teams in a knock-out tournament that allows them to advance directly to the next round without playing a match in the current round. Think of it as a free pass: while other teams compete and risk elimination, a team with a bye waits and enters the tournament fresh in the subsequent round.
Byes exist because knock-out tournaments work cleanly only when the number of teams is a power of 2 — that is, 2, 4, 8, 16, 32, 64, and so on. With these numbers every team can be paired in the first round, and the bracket halves neatly in each successive round until one champion remains. But most real tournaments do not have exactly 4 or 8 or 16 teams; they have 5, 11, 13, or some other awkward number. Byes fill the gap, ensuring that after the first round the remaining number of teams is a power of 2 and the bracket proceeds smoothly.
How the Number of Byes is Determined
The formula is straightforward:
Number of byes = (next higher power of 2) - N
where N is the total number of teams entered in the tournament.
Step-by-step:
- Identify the number of teams, N.
- Find the smallest power of 2 that is greater than or equal to N. (The powers of 2 are 2, 4, 8, 16, 32, 64…)
- Subtract N from that power of 2. The result is the number of byes.
If N is already a power of 2 (for example, 8 or 16 teams), then the next higher power of 2 is N itself, so the number of byes is N - N = 0. No byes are needed; every team plays in the first round.
Examples
Example 1: Suppose 11 teams enter a knock-out tournament.
- The next higher power of 2 above 11 is 16.
- Number of byes = 16 - 11 = 5.
Five teams receive byes in the first round. The remaining 11 - 5 = 6 teams play three matches (since each match eliminates one team). After the first round, 5 + 3 = 8 teams remain — a power of 2 — and the bracket proceeds without further byes.
Example 2: A tournament has 13 teams.
- Next higher power of 2 is 16.
- Number of byes = 16 - 13 = 3.
Three teams get byes; ten teams play five first-round matches, leaving 3 + 5 = 8 teams for the second round.
Example 3: Exactly 16 teams enter.
- Next higher power of 2 is 16.
- Number of byes = 16 - 16 = 0.
No byes. All 16 teams play in the first round, producing 8 winners who advance.
Why This Formula Works
A knock-out tournament eliminates one team per match until only the champion remains. The total number of matches in a knock-out tournament is always N - 1 (because N - 1 teams must be eliminated). But for the bracket to be balanced — so that each round has an even number of teams and can be paired — the number of teams entering any round must be a power of 2. …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.