Free CAT library

Sports Based: Concepts & Solved Examples

Master the mathematical architectures and deductive algorithms of Sports-Based Reasoning in CAT DILR. Formulate round-robin combinatorial conservation laws (N(N-1)/2 matches, sum of wins equals sum of losses, parity constraints in 2-point and 3-point league tables), analyze seeded knockout brackets (powers of 2, seed-sum invariants, minimum/maximum upset propagation, branch tracebacks), compute…

1. Foundational Taxonomy of Sports & Tournament Reasoning

Sports-based and tournament reasoning sets represent one of the most intellectually rigorous and recurring genres in the CAT Data Interpretation and Logical Reasoning (DILR) section. Rather than testing trivia about athletics, these problems evaluate an aspirant's mastery of combinatorial conservation laws, modular parity constraints, algebraic zero-sum invariants, and binary tree bracket architectures.

In modern CAT administrations, sports puzzles are framed across a rich variety of competitive contexts, including football and hockey leagues, cricket tournaments, seeded tennis and chess brackets, multi-heat racing championships, and competitive cyber-warfare or algorithmic benchmarking arenas.

CAT-level sports problems broadly classify into four foundational mathematical architectures:

  1. Round-Robin Tournaments (Single & Multi-Stage Leagues): Every team plays against every other team a fixed number of times. Problems demand reconstructing incomplete league standings tables using point conservation laws, win-loss balances, and goal/point differentials.

  2. Seeded Knockout Championships (Single-Elimination Brackets): N=2kN = 2^k competitors are seeded based on prior rankings. In each round, half the competitors are eliminated. Puzzles focus on bracket path reconstruction, tracking potential upsets, and finding the highest/lowest possible seed a given player can meet.

  3. Multi-Heat / Multi-Stage Racing Deductions: Competitors participate across multiple heats, trials, or stages. Problems center on rank consistency, rank-to-point mappings, maximum/minimum aggregate scores, and invariant position constraints.

  4. Rate Differential & Tie-Breaker Metrics (Net Run Rate / Net Lap Rate): In cricket, motorsport, or high-throughput benchmarks, margins of victory determine qualification through Net Run Rate (NRR) or goal difference, governed by closed-system algebraic conservation.


2. Round-Robin Tournament Mathematics & Invariants

A round-robin tournament is a closed combinatorial design where every participant competes against all other participants.

A. Total Match Count

For a tournament of NN teams:

  • In a Single Round-Robin tournament, where each pair plays exactly once:

    Msingle=(N2)=N(N−1)2M_{\text{single}} = \binom{N}{2} = \frac{N(N - 1)}{2}

  • In a Double Round-Robin tournament, where each pair plays exactly twice (home and away):

    Mdouble=2×(N2)=N(N−1)M_{\text{double}} = 2 \times \binom{N}{2} = N(N - 1)

  • Each individual team plays exactly N−1N - 1 matches in a single round-robin, and 2(N−1)2(N - 1) matches in a double round-robin.

B. The Fundamental Win-Loss Conservation Law

Every decisive match produces exactly one winning team and one losing team. If a match ends in a draw, neither team wins or loses.

Therefore, across the entire tournament:

∑i=1NWi=∑i=1NLi=Mdecisive\sum_{i=1}^N W_i = \sum_{i=1}^N L_i = M_{\text{decisive}}

where WiW_i and LiL_i denote the number of matches won and lost by team ii, and MdecisiveM_{\text{decisive}} is the total number of non-drawn matches.

Furthermore, because every drawn match involves exactly two teams:

∑i=1NDi=2×Mdraw\sum_{i=1}^N D_i = 2 \times M_{\text{draw}}

where DiD_i is the number of draws recorded by team ii. Consequently, the sum of the draw tallies across all teams in any league table must strictly be an EVEN integer.

C. Points Systems & Total Points Conservation

Scoring SystemWin Points ($P_W$)Draw Points ($P_D$)Loss Points ($P_L$)Points per MatchTotal Points Pool Across League ($\sum P_i$)
2-Point System (Standard Cricket / Hockey / Chess)210Constant: 2
(Decisive: $2+0=2$, Draw: $1+1=2$)
$$\sum_{i=1}^N P_i = 2 \times M_{\text{total}} = N(N - 1)$$
3-Point System (Standard FIFA Soccer)310Decisive: $3+0=3$
Draw: $1+1=2$
$$\sum_{i=1}^N P_i = 3 \times M_{\text{total}} - M_{\text{draw}}$$

[!IMPORTANT]

The 3-Point Draw Deficit Invariant: In a 3-point system (soccer), every drawn match destroys exactly 1 point from the theoretical maximum points pool! If a league of MM matches yields a total sum of points SS, then the number of drawn matches is identically:

Mdraw=3M−SM_{\text{draw}} = 3M - S

D. Parity Constraints on Individual Points

In a 2-point system, team ii's total points are given by:

Pi=2Wi+DiP_i = 2W_i + D_i

  • Since 2Wi2W_i is always an even integer, the parity of PiP_i is governed entirely by DiD_i:

    • If a team has an odd number of draws (Di=1,3,…D_i = 1, 3, \dots), its total points PiP_i MUST be an odd integer.

    • If a team has an even number of draws (Di=0,2,…D_i = 0, 2, \dots), its total points PiP_i MUST be an even integer.

  • This parity constraint is the primary algebraic wedge used in CAT to deduce points in partially filled tournament tables.


3. Seeded Knockout Bracket Architecture

In a standard single-elimination seeded knockout tournament:

  • The number of competitors is a power of 2: N=2kN = 2^k.

  • The tournament consists of k=log⁡2Nk = \log_2 N successive rounds.

  • Each match eliminates exactly one competitor. Thus, to determine a unique champion from NN competitors, exactly N−1N - 1 matches must be played.

A. The Seed-Sum Invariant

Competitors are seeded from 1 (the strongest / top seed) to NN (the lowest seed). The draw is arranged so that the highest seeds do not meet until the final rounds.

In Round 1, Match mm pairs Seed mm with Seed (N+1−m)(N + 1 - m) (for m=1,2,…,N/2m = 1, 2, \dots, N/2):

Seed(A)+Seed(B)=N+1\text{Seed}(A) + \text{Seed}(B) = N + 1

For N=64N = 64, every first-round match satisfies: Seed1+Seed2=65\text{Seed}_1 + \text{Seed}_2 = 65.

  • Match 1: Seed 1 vs Seed 64

  • Match 2: Seed 2 vs Seed 63

  • …

  • Match 32: Seed 32 vs Seed 33

In Round 2, if all higher seeds win their first-round matches (i.e., no upsets occur), Match mm pairs the winner of Match mm with the winner of Match (N/2+1−m)(N/2 + 1 - m):

Seed1+Seed2=N2+1\text{Seed}_1 + \text{Seed}_2 = \frac{N}{2} + 1

For N=64N = 64: Seed 1 plays Seed 32, Seed 2 plays Seed 31, …, Seed 16 plays Seed 17. The seed sum is 32+1=3332 + 1 = 33.

In general, in Round rr (where r=1,2,…,kr = 1, 2, \dots, k), if no upsets occur in prior rounds, the sum of the seeds meeting in each match is constant:

Sum of Seeds in Round r=N2r−1+1\text{Sum of Seeds in Round } r = \frac{N}{2^{r-1}} + 1

Round Number ($r$)Round Designation ($N=64$)Remaining PlayersMatches PlayedExpected Matchup Seed Sum (No Upsets)Top Matchup Example
$r = 1$Round of 646432$64 + 1 = \mathbf{65}$Seed 1 vs Seed 64
$r = 2$Round of 323216$32 + 1 = \mathbf{33}$Seed 1 vs Seed 32
$r = 3$Round of 16168$16 + 1 = \mathbf{17}$Seed 1 vs Seed 16
$r = 4$Quarterfinals84$8 + 1 = \mathbf{9}$Seed 1 vs Seed 8
$r = 5$Semifinals42$4 + 1 = \mathbf{5}$Seed 1 vs Seed 4
$r = 6$Championship Final21$2 + 1 = \mathbf{3}$Seed 1 vs Seed 2

B. Upsets and Bracket Branch Tracing

An upset occurs whenever a competitor with a higher numerical seed (lower ranking) defeats a competitor with a lower numerical seed (higher ranking).

To determine which competitors can meet in a given round, we trace the binary bracket tree backwards:

  • Round 1 Opponent of Seed ss: s1′=N+1−ss_1' = N + 1 - s.

  • Round 2 Potential Opponents: The winner of the sibling first-round match.

    • Sibling match index for Seed ss: if Match m=min⁡(s,N+1−s)m = \min(s, N+1-s), its Round 2 sibling match is m′=N/2+1−mm' = N/2 + 1 - m.

    • Competitors in that sibling match: Seed m′m' and Seed (N+1−m′)(N + 1 - m').

  • Quarterfinal / Semifinal Branch Cohorts: Every competitor belongs to an invariant subtree of size 2r2^r in Round rr. Two competitors can NEVER play against each other before the round at which their lowest common ancestor (LCA) in the bracket tree merges!


4. Net Run Rate (NRR) & Differential Metrics

In cricket tournaments, automotive time trials, and computational benchmarking, ties in standings are resolved using rate differentials.

A. Mathematical Definition of Net Run Rate (NRR)

For a cricket team across a series of completed matches:

NRR=(Total Runs ScoredTotal Overs Faced)−(Total Runs ConcededTotal Overs Bowled)\text{NRR} = \left( \frac{\text{Total Runs Scored}}{\text{Total Overs Faced}} \right) - \left( \frac{\text{Total Runs Conceded}}{\text{Total Overs Bowled}} \right)

For an individual match where both teams bat their full quota of TT overs (e.g., T=20T = 20 in T20 cricket):

NRRmatch=Runs Scored−Runs ConcededT=ΔrunsT\text{NRR}_{\text{match}} = \frac{\text{Runs Scored} - \text{Runs Conceded}}{T} = \frac{\Delta_{\text{runs}}}{T}

Δruns=NRRmatch×T\Delta_{\text{runs}} = \text{NRR}_{\text{match}} \times T

B. Total Net Run Rate (TNRR) and Closed-League Conservation

When every match in a tournament is completed across the full quota of overs:

TNRR=∑m=1kNRRm=∑ΔrunsT\text{TNRR} = \sum_{m=1}^k \text{NRR}_m = \frac{\sum \Delta_{\text{runs}}}{T}

In any closed league where teams play exclusively among themselves:

∑all teamsΔruns=0  ⟹  ∑all teamsTNRR=0\sum_{\text{all teams}} \Delta_{\text{runs}} = 0 \implies \sum_{\text{all teams}} \text{TNRR} = 0

The sum of net margins across all participating teams is identically zero. A gain in margin for one team is an exact loss for its opponents.


5. Multi-Heat Racing & Positional Deductions

In racing tournaments (Formula 1 heats, drone racing, athletic sprints), ranking positions across multiple trials are constrained by relational logic:

  1. Strict Permutation Per Heat: In an nn-competitor heat, the finishing positions must form a strict permutation of {1,2,…,n}\{1, 2, \dots, n\}.

  2. Dominance Relations: If competitor AA beat competitor BB in all heats, then Rankh(A)<Rankh(B)\text{Rank}_h(A) < \text{Rank}_h(B) for every heat hh. If BB finishes 2nd in a heat, AA MUST finish 1st in that heat.

  3. Uniqueness of Recurring Ranks: Statements such as "Exactly one competitor finished at the identical rank across both heats" require testing all candidate entities against parity and positional exclusion bounds.

  4. Aggregate Point Maximization: Standings are resolved by mapping rank to points (R↦P(R)R \mapsto P(R)). When chronological heat order is omitted, questions asking "Who improved from Heat 1 to Heat 2?" cannot be definitively answered unless chronology is uniquely identified.


6. Discrete Probing & Binary Hardware Enclaves

In cryptographic game puzzles and discrete tournament challenges:

  • Unknown discrete weights w⃗=(w1,w2,…,wn)\vec{w} = (w_1, w_2, \dots, w_n) reside in hardware registers.

  • Binary probe vectors x⃗=(x1,x2,…,xn)∈{0,1}n\vec{x} = (x_1, x_2, \dots, x_n) \in \{0, 1\}^n generate scalar responses:

    y=x⃗⋅w⃗=∑i=1nxiwiy = \vec{x} \cdot \vec{w} = \sum_{i=1}^n x_i w_i

  • Standard Basis Probing: The elementary basis vectors e1=(1,0,0,0),e2=(0,1,0,0),e3=(0,0,1,0),e4=(0,0,0,1)e_1 = (1, 0, 0, 0), e_2 = (0, 1, 0, 0), e_3 = (0, 0, 1, 0), e_4 = (0, 0, 0, 1) isolate individual registers directly. In decimal notation for 4 bits, these correspond to inputs 8,4,2,18, 4, 2, 1.

  • Linear Combinations & Invariant Sums: When probing subsets, the sum of all elements 1⃗⋅w⃗=∑wi\vec{1} \cdot \vec{w} = \sum w_i acts as a master constraint. Probing the complement (1−ei)(1 - e_i) yields the master sum minus wiw_i, allowing single-step recovery of unknown primes and even composites.

Formulas

Round-Robin Match & Points Invariant

M=N(N−1)2,∑i=1NPi=2M=N(N−1)  (in 2-pt league)M = \frac{N(N-1)}{2}, \quad \sum_{i=1}^N P_i = 2M = N(N-1) \; (\text{in 2-pt league})

In any single round-robin tournament with 2 points per win and 1 point per draw, the sum of points of all teams is strictly constant and equal to N(N-1).
Draw Deficit in 3-Point Leagues

Mdraw=3M−∑i=1NPi=3N(N−1)2−∑i=1NPiM_{\text{draw}} = 3M - \sum_{i=1}^N P_i = \frac{3N(N-1)}{2} - \sum_{i=1}^N P_i

In a 3-point soccer league, every draw reduces the total points distributed across all teams by exactly 1 point below the theoretical maximum of 3M.
Seeded Knockout Bracket Invariant

SeedA+SeedB=N2r−1+1(Round r, no upsets)\text{Seed}_A + \text{Seed}_B = \frac{N}{2^{r-1}} + 1 \quad (\text{Round } r, \text{ no upsets})

In an N-player seeded knockout tournament, if no upsets occur, the sum of the seeds meeting in round r is constant. In Round 1, the sum is N+1; in Round 2, N/2 + 1.
Net Run Rate & Margin Conservation

NRR=∑Rscored∑Ofaced−∑Rconceded∑Obowled,∑all teamsΔruns=0\text{NRR} = \frac{\sum R_{\text{scored}}}{\sum O_{\text{faced}}} - \frac{\sum R_{\text{conceded}}}{\sum O_{\text{bowled}}}, \quad \sum_{\text{all teams}} \Delta_{\text{runs}} = 0

In completed matches of equal length, the match run margin is Delta = NRR * Overs. In a closed league, the sum of all run margins across all teams is identically zero.

Traps and tips

  • Trap 1: Confusing 2-Point and 3-Point League Point Invariants — In 2-point leagues (cricket/hockey/chess), every match awards 2 points in total whether it is decisive (2+0) or drawn (1+1). The total points pool is STRICTLY INVARIANT at N(N−1)N(N-1). However, in 3-point leagues (soccer), a decisive match awards 3 points while a draw awards only 2 points. Never assume total points are constant in a 3-point league without computing the draw deficit!
  • Trap 2: Misapplying the Seed-Sum Invariant After Upsets — The elegant formula Seed1+Seed2=N/2r−1+1\text{Seed}_1 + \text{Seed}_2 = N/2^{r-1} + 1 holds ONLY if all preceding matches were won by higher-ranked seeds. As soon as an upset occurs, the lower-ranked winner inherits the slot of the defeated higher seed in the bracket tree. Always trace the static bracket tree structure rather than relying blindly on seed sums.
  • Trap 3: Averaging Match NRRs Instead of Aggregating Raw Totals — A frequent mathematical blunder is calculating tournament Net Run Rate as the arithmetic mean of individual match NRRs: NRR≠1k∑NRRm\text{NRR} \ne \frac{1}{k}\sum \text{NRR}_m. While this shortcut holds only when every match has the EXACT same overs bowled and faced, official tournament NRR requires summing all runs scored across all matches, dividing by total overs faced, and subtracting total runs conceded divided by total overs bowled.
  • Trap 4: Chronology Assumption in Multi-Heat Racing — When clues state 'Drone A finished 1st in one circuit and 3rd in the other', aspirants often assume the first mentioned circuit was Circuit Alpha and the second was Circuit Beta. Unless the problem explicitly binds an event to a chronological sequence, statements like 'Who improved in the second heat?' must be answered as 'Cannot be determined'.
  • Trap 5: The Draw Parity Oversight in Standings Tables — Remember that Pi=2Wi+DiP_i = 2W_i + D_i. Since 2Wi2W_i is even, the parity of a team's total points uniquely reveals the parity of its drawn matches! If a team has an odd point total (e.g., 7 or 9), it MUST have had an odd number of draws (at least 1). If you overlook this parity wedge, you will miss the key breakthrough in reconstructing incomplete round-robin tables.

Solved examples

Solved Example Set 1: Questions 1 to 4 (Autonomous Drone Racing Championship — Standings & Rank Deductions)

Directions for Examples 1 to 4

Four next-generation autonomous racing drones — Apex-1, Boreas-V, Cygnus-X, and Drift-9 — participated in the Autonomous Drone Grand Prix comprising two high-altitude obstacle circuits: Circuit Alpha and Circuit Beta. In each circuit, all four drones competed simultaneously, and finishing times were recorded.

The following information regarding the finishing positions (ranks 1 to 4) is known:

  1. No two drones secured the same rank position in either of the circuits.

  2. Exactly one drone, out of the four, secured the identical rank position in both circuits.

  3. Apex-1 did not secure the last position (4th) in either of the circuits.

  4. Cygnus-X outperformed Drift-9 (secured a strictly superior / lower numerical rank) in both circuits.

  5. Boreas-V secured 1st position in at least one of the two circuits.

  6. Apex-1 secured 3rd position in at least one of the two circuits.

  7. Drift-9 secured 2nd position in one of the circuits, and Cygnus-X secured 2nd position in the other circuit.


Question 1: In each circuit, championship points were awarded according to finishing position: 1st place received 10 points, 2nd place received 6 points, 3rd place received 3 points, and 4th place received 1 point. If the tournament champion was the drone whose aggregate points across the two circuits was the maximum, who won the championship?

(1) Apex-1

(2) Boreas-V

(3) Cygnus-X

(4) Drift-9

Question 2: Which drone(s) secured a strictly better finishing position in Circuit Beta compared to Circuit Alpha?

(1) Apex-1

(2) Both Cygnus-X and Drift-9

(3) Boreas-V

(4) Cannot be determined

Question 3: For which drone was the absolute difference between the rank positions secured in the two circuits the maximum?

(1) Apex-1

(2) Boreas-V

(3) Cygnus-X

(4) Drift-9

Question 4: Which drone secured the exact same rank position in both circuits?

(1) Boreas-V

(2) Apex-1

(3) Cygnus-X

(4) Drift-9

Show solution

Step-by-Step Deductive Analysis

Let the two circuits be designated as Circuit 1 and Circuit 2 (we cannot assume chronological order between Alpha and Beta).

Step 1: Analyze Clues 4 and 7 (Drift-9 and Cygnus-X)

  • Clue 7 states: Drift-9 secured 2nd position in one circuit, and Cygnus-X secured 2nd position in the other circuit.

  • Without loss of generality, let Drift-9 be 2nd in Circuit 1, and Cygnus-X be 2nd in Circuit 2.

  • Clue 4 states: Cygnus-X outperformed Drift-9 in both circuits (RankC<RankD\text{Rank}_C < \text{Rank}_D).

  • In Circuit 1, since Drift-9 secured 2nd position, Cygnus-X must have secured a better rank than 2nd. The only available rank superior to 2nd is 1st position!

    Circuit 1: Rank 1=Cygnus-X,Rank 2=Drift-9\text{Circuit 1: Rank 1} = \text{Cygnus-X}, \quad \text{Rank 2} = \text{Drift-9}

Step 2: Determine Rank 1 in Circuit 2

  • Clue 5 states: Boreas-V secured 1st position in at least one of the two circuits.

  • In Circuit 1, 1st position was secured by Cygnus-X. Therefore, Boreas-V MUST secure 1st position in Circuit 2!

    Circuit 2: Rank 1=Boreas-V,Rank 2=Cygnus-X\text{Circuit 2: Rank 1} = \text{Boreas-V}, \quad \text{Rank 2} = \text{Cygnus-X}

Step 3: Place Apex-1 and Resolve Remaining Ranks

  • In Circuit 1, ranks 1 and 2 are filled by Cygnus-X and Drift-9. The remaining ranks are 3rd and 4th, to be shared by Apex-1 and Boreas-V.

  • Clue 3 states: Apex-1 did not secure last position (4th) in either circuit.

  • Therefore, in Circuit 1, Apex-1 MUST be 3rd, and Boreas-V MUST be 4th!

    Circuit 1 Standings: 1st: Cygnus-X,  2nd: Drift-9,  3rd: Apex-1,  4th: Boreas-V\text{Circuit 1 Standings: } 1\text{st: Cygnus-X}, \; 2\text{nd: Drift-9}, \; 3\text{rd: Apex-1}, \; 4\text{th: Boreas-V}

  • Now look at Circuit 2: ranks 1 and 2 are filled by Boreas-V and Cygnus-X. Ranks 3rd and 4th remain for Apex-1 and Drift-9.

  • Clue 2 states: Exactly one drone secured the identical rank position in both circuits.

  • Clue 3 ensures Apex-1 cannot be 4th in Circuit 2. Thus, Apex-1 MUST be 3rd in Circuit 2 as well!

  • This leaves Drift-9 in 4th position in Circuit 2.

  • Let us verify Clue 4 in Circuit 2: Cygnus-X (2nd) outperformed Drift-9 (4th). This is fully satisfied!

  • Check identical rank condition across both circuits:

    • Cygnus-X: 1st and 2nd (different)

    • Drift-9: 2nd and 4th (different)

    • Boreas-V: 4th and 1st (different)

    • Apex-1: 3rd and 3rd (IDENTICAL!)

    Exactly one drone (Apex-1) secured the identical position. All conditions hold uniquely!

Final Reconstructed Standings Table

Rank PositionCircuit 1 (One Circuit)Circuit 2 (Other Circuit)
1st (10 pts)Cygnus-XBoreas-V
2nd (6 pts)Drift-9Cygnus-X
3rd (3 pts)Apex-1Apex-1
4th (1 pt)Boreas-VDrift-9

Answers to Questions:

Question 1: Championship Points:

  • Cygnus-X: 10+6=1610 + 6 = 16 points

  • Boreas-V: 1+10=111 + 10 = 11 points

  • Drift-9: 6+1=76 + 1 = 7 points

  • Apex-1: 3+3=63 + 3 = 6 points

The champion was Cygnus-X with 16 points. Correct Choice: (3)

Question 2: Because the problem statement does not specify whether Circuit 1 was Circuit Alpha or Circuit Beta, we cannot determine which drone improved its rank chronologically. Correct Choice: (4) Cannot be determined

Question 3: Absolute difference in rank:

  • Apex-1: ∣3−3∣=0|3 - 3| = 0

  • Cygnus-X: ∣1−2∣=1|1 - 2| = 1

  • Drift-9: ∣2−4∣=2|2 - 4| = 2

  • Boreas-V: ∣4−1∣=3|4 - 1| = 3 (Maximum!)

Correct Choice: (2) Boreas-V

Question 4: Apex-1 secured 3rd position in both circuits. Correct Choice: (2) Apex-1

Solved Example Set 2: Questions 5 to 8 (Global AI Chess Invitational — 64-Engine Seeded Knockout Championship)

Directions for Examples 5 to 8

In the Global AI Chess Invitational, the top 64 autonomous neural chess engines, seeded from Seed 1 (highest-ranked) to Seed 64 (lowest-ranked), participated in a single-elimination knockout tournament.

The tournament structure is governed by standard complementary bracket pairings:

  • In the first round (Round of 64), 32 matches were played: Match 1 was played between Seed 1 and Seed 64, Match 2 between Seed 2 and Seed 63, and in general, Match kk was played between Seed kk and Seed (65−k)(65 - k) (for k=1,2,…,32k = 1, 2, \dots, 32).

  • In the second round (Round of 32), the winner of Match 1 played the winner of Match 32, the winner of Match 2 played the winner of Match 31, and in general, the winner of Match kk played the winner of Match (33−k)(33 - k) (for k=1,2,…,16k = 1, 2, \dots, 16).

  • In the third round (Round of 16), the winner of Round 2 Match kk played the winner of Round 2 Match (17−k)(17 - k) (for k=1,2,…,8k = 1, 2, \dots, 8).

  • This pattern continued in the Quarterfinals (Round 4), Semifinals (Round 5), and the Championship Final (Round 6).

  • An upset is defined as an outcome where a lower-ranked engine (higher numerical seed) defeats a higher-ranked engine (lower numerical seed).


Question 5: If there was no upset in the 1st and 3rd rounds, and every single match in the 2nd round resulted in an upset, what was the highest-ranked engine (lowest numerical seed) that could win the championship?

(1) Seed 16

(2) Seed 24

(3) Seed 32

(4) None of these

Question 6: If the engine seeded 54 reached the semifinals, which of the following engines could have won the championship?

(1) Seed 22

(2) Seed 59

(3) Seed 38

(4) None of these

Question 7: If the engine seeded 16 reached the semifinals, what was the absolute minimum number of upsets that must have occurred across the entire tournament?

(1) 2

(2) 3

(3) 4

(4) More than 4

Question 8: If the tournament champion, OmniZero (Seed 1), defeated KryptonNet in the Quarterfinals and VortexEngine in Round 2, what was the maximum possible sum of the seed numbers of KryptonNet and VortexEngine?

(1) 72

(2) 73

(3) 90

(4) 89

Show solution

Step-by-Step Deductive Analysis

Bracket Architecture Analysis (N=64N = 64)

  • Round 1: Match kk pairs Seed kk with Seed (65−k)(65 - k). Sum =65= 65.

  • Round 2: Match kk pairs Winner(Match kk) with Winner(Match 33−k33 - k). Sum =33= 33 (if no upsets).

  • Round 3 (Round of 16): Pairs Winner(R2 Match mm) with Winner(R2 Match 17−m17 - m). Sum =17= 17 (if no upsets).

  • Round 4 (Quarterfinals): Pairs winners within quarters of 8 branches. Sum =9= 9 (if no upsets).

  • Round 5 (Semifinals): Top half winner vs Bottom half winner. Sum =5= 5 (if no upsets).

  • Round 6 (Final): Sum =3= 3 (Seed 1 vs Seed 2, if no upsets).

Question 5 Analysis:

  • Round 1 (No upsets): In all 32 matches, the higher-ranked seed wins. Thus, Seeds 1 through 32 advance to Round 2.

  • Round 2 (All upsets): The 16 matches are: Seed 1 vs 32, Seed 2 vs 31, ..., Seed 16 vs 17.

    Because EVERY match is an upset, the lower-ranked engines (higher seeds) defeat the higher-ranked engines:

    • Seed 32 defeats Seed 1

    • Seed 31 defeats Seed 2

    • …

    • Seed 17 defeats Seed 16

    Therefore, the engines advancing to Round 3 are Seeds 17 through 32.

  • Round 3 (No upsets): Match pairings pit Winner(Match kk) against Winner(Match 17−k17 - k).

    For instance, Match 1 winner (Seed 32) plays Match 16 winner (Seed 17). Since no upsets occur in Round 3, the higher-ranked engine wins: Seed 17 defeats Seed 32.

  • Notice that across the entire pool of survivors in Round 3, Seed 17 is the highest-ranked engine in the tournament! If Seed 17 continues to win subsequent rounds, it wins the championship. Hence, the highest-ranked engine that could win the final is Seed 17.

  • Among the options: (1) 16, (2) 24, (3) 32, (4) None of these. Since 17 is not listed, the answer is (4) None of these.

Question 6 Analysis:

  • Trace the bracket branch containing Seed 54:

    • In Round 1, Seed 54 plays Seed 65−54=1165 - 54 = \mathbf{11} in Match 11.

    • In Round 2, the winner of Match 11 plays the winner of Match 33−11=2233 - 11 = \mathbf{22}. Match 22 in Round 1 was between Seed 22 and Seed 65−22=4365 - 22 = 43. Thus, Seed 22 is in Seed 54's Round 2 branch!

    • In Round 3, the survivor of branch (11, 54, 22, 43) plays the survivor of Round 2 Match 17−11=617 - 11 = \mathbf{6}.

      Round 2 Match 6 combines Round 1 Match 6 (Seed 6 vs Seed 65−6=5965 - 6 = \mathbf{59}) and Round 1 Match 33−6=2733 - 6 = \mathbf{27} (Seed 27 vs Seed 65−27=3865 - 27 = \mathbf{38}).

      Thus, Seed 59 and Seed 38 are in this exact same Round of 16 cohort!

    • In Round 4 (Quarterfinals), the survivor of this group of 8 plays for a spot in the semifinals.

  • Therefore, Seeds 22, 59, and 38 all belong to Seed 54's Quarter of the draw! For Seed 54 to reach the semifinals, Seed 54 must have won this entire quarter, eliminating Seeds 22, 59, and 38 prior to the semifinals. None of them could reach the final or win the championship!

Correct Choice: (4) None of these

Question 7 Analysis:

  • We want the minimum number of upsets across the entire tournament such that Seed 16 reaches the semifinals.

  • To minimize upsets globally, assume all matches NOT involving Seed 16 are won by the higher-ranked seed (0 upsets).

  • Let us trace Seed 16's path to the semifinals (4 rounds: R1, R2, R3, QF):

    • Round 1: Seed 16 plays Seed 65−16=4965 - 16 = 49. Seed 16 is higher-ranked (16<4916 < 49), so Seed 16 winning is NOT an upset (0 upsets).

    • Round 2: Seed 16 plays the winner of Match 33−16=1733 - 16 = 17 (Seeds 17 vs 48). If Seed 17 won, Seed 16 plays Seed 17. Since Seed 16 is higher-ranked (16<1716 < 17), Seed 16 winning is NOT an upset (0 upsets).

    • Round 3 (Round of 16): Seed 16's branch meets the branch of Match 1 (where Seed 1 resides). If Seed 1 won its first two matches, Seed 16 must play Seed 1. For Seed 16 to defeat Seed 1, this MUST be an upset (Upset #1).

    • Round 4 (Quarterfinals): Seed 16 plays the survivor of the sibling quarter containing Seed 8. If Seed 8 won its matches, Seed 16 plays Seed 8. For Seed 16 to defeat Seed 8, this MUST be an upset (Upset #2).

  • If all other matches across the draw proceed according to seeding, the tournament requires exactly 2 upsets for Seed 16 to reach the semifinals.

Correct Choice: (1) 2

Question 8 Analysis:

  • Top-seeded champion OmniZero (Seed 1) defeated VortexEngine in Round 2 and KryptonNet in the Quarterfinals.

  • Round 2 Opponent of Seed 1:

    Seed 1 plays the winner of Match 33−1=3233 - 1 = 32 (Seed 32 vs Seed 65−32=3365 - 32 = 33).

    The possible engines arriving in Round 2 against Seed 1 are Seed 32 or Seed 33. To maximize the seed number, VortexEngine was Seed 33.

  • Quarterfinal Opponent of Seed 1:

    In the Quarterfinals, Seed 1's branch meets the quarter originating from Round 1 Match 9−1=89 - 1 = 8.

    The branches in that quarter encompass Seeds 8, 9, 24, 25, 40, 41, 56, and 57.

    Specifically, Round 1 Match 8 is between Seed 8 and Seed 65−8=5765 - 8 = \mathbf{57}.

    If Seed 57 caused successive upsets in Rounds 1, 2, and 3, Seed 57 would reach the Quarterfinals against Seed 1!

    Thus, the maximum possible seed number for KryptonNet is Seed 57.

  • The maximum possible sum of their seed numbers is:

    Maximum Sum=33+57=90\text{Maximum Sum} = 33 + 57 = \mathbf{90}

Correct Choice: (3) 90

Solved Example Set 3: Questions 9 to 12 (Cyber-Defense CTF Tournament — Round-Robin League & Parity Deductions)

Directions for Examples 9 to 12

Six elite cybersecurity syndicates — Aegis Alliance, Bastion Cyber, Cerberus Sec, Daedalus Net, Echo Labs, and Sentinel Ops — participated in an invitational single round-robin cyber warfare tournament, in which each syndicate engaged every other syndicate exactly once. The syndicate with the highest points at the conclusion of the championship was declared the winner.

In every match, the winner was awarded 2 points and the loser was awarded 0 points. If a match ended in a draw, both syndicates were awarded 1 point each.

The following table provides partial information regarding the final tournament records of the six syndicates:

SyndicateMatches Won ($W$)Matches Drawn ($D$)Matches Lost ($L$)Total Points ($P$)
Aegis Alliance—1——
Bastion Cyber———4
Cerberus Sec——3—
Daedalus Net—1——
Echo Labs———7
Sentinel Ops————

The following additional intelligence is confirmed:

(i) Daedalus Net finished with the strictly maximum number of points, but Cerberus Sec did not finish with the minimum number of points.

(ii) No two syndicates finished with the same number of points (all 6 point totals were strictly distinct).

(iii) The match between Aegis Alliance and Daedalus Net ended in a draw.

(iv) Cerberus Sec lost its match against Aegis Alliance, but won against the syndicate that finished with the minimum number of points.

(v) The total number of drawn matches across the entire tournament was not more than 2.


Question 9: What was the absolute difference between the total points earned by Aegis Alliance and Sentinel Ops at the end of the tournament?

(1) 2

(2) 3

(3) 4

(4) 5

Question 10: What was the total number of points with which Daedalus Net finished the tournament?

(1) 8

(2) 9

(3) 10

(4) Either (1) or (2)

Question 11: Which of the following statements alone would be sufficient to find the result of every individual match in the tournament uniquely?

(1) The only syndicate that lost against Cerberus Sec defeated Aegis Alliance.

(2) The syndicate against which Cerberus Sec played a draw defeated Sentinel Ops.

(3) Aegis Alliance defeated Sentinel Ops.

(4) Both (1) and (3) alone are sufficient.

Question 12: What was the total number of points earned by all six syndicates put together?

(1) 28

(2) 26

(3) 30

(4) Either (1) or (2)

Show solution

Step-by-Step Deductive Analysis

Step 1: Combinatorial Match Count & Total Points Conservation

  • Number of syndicates N=6N = 6. In a single round-robin, total matches played is:

    M=6×52=15 matchesM = \frac{6 \times 5}{2} = 15 \text{ matches}

  • Each match awards 2 points in total (2+0 for a decisive win, or 1+1 for a draw).

  • Therefore, the sum of points of all 6 syndicates is strictly invariant:

    ∑i=16Pi=15×2=30 points\sum_{i=1}^6 P_i = 15 \times 2 = \mathbf{30} \text{ points}

    This immediately answers Question 12: 30 points (Option 3).

Step 2: Points Formula & Parity Analysis

  • Each syndicate plays exactly N−1=5N - 1 = 5 matches: Wi+Di+Li=5W_i + D_i + L_i = 5.

  • Points earned: Pi=2Wi+DiP_i = 2W_i + D_i.

  • Since 2Wi2W_i is even, PiP_i is odd if and only if DiD_i is odd.

Step 3: Deduce Points for Daedalus Net (PDP_D)

  • Daedalus Net has D=1D = 1 (drew against Aegis Alliance, Clue iii). Thus, PD=2W+1P_D = 2W + 1, which MUST be an odd integer.

  • Maximum possible points with 1 draw (4 wins, 1 draw) is 2(4)+1=92(4) + 1 = 9 points.

  • Clue (i) confirms Daedalus Net had the strictly highest points in the tournament. Since Echo Labs already has 7 points, PDP_D must be strictly greater than 7. The only odd integer ≤9\le 9 that is greater than 7 is 9!

    PDaedalus=9(W=4,D=1,L=0)P_{\text{Daedalus}} = \mathbf{9} \quad (W=4, D=1, L=0)

    This immediately answers Question 10: 9 points (Option 2).

Step 4: Deduce Points for Cerberus Sec, Aegis Alliance, and Sentinel Ops

  • Cerberus Sec has L=3L = 3 (from table). Thus, W+D=5−3=2W + D = 5 - 3 = 2.

  • Clue (iv) states Cerberus Sec won against the lowest-ranked syndicate (W≥1W \ge 1).

    • If W=2,D=0  ⟹  PCerberus=4W = 2, D = 0 \implies P_{\text{Cerberus}} = 4. But Bastion Cyber already has 4 points, and all points are distinct (Clue ii)! This is impossible.

    • Thus, Cerberus Sec MUST have W=1,D=1W = 1, D = 1, giving:

      PCerberus=2(1)+1=3 points(W=1,D=1,L=3)P_{\text{Cerberus}} = 2(1) + 1 = \mathbf{3} \text{ points} \quad (W=1, D=1, L=3)

  • Now examine the sum of points across all six syndicates:

    • Known points so far: Daedalus (9) + Echo Labs (7) + Bastion Cyber (4) + Cerberus Sec (3) = 23 points.

    • Remaining sum for Aegis Alliance and Sentinel Ops:

      PAegis+PSentinel=30−23=7 pointsP_{\text{Aegis}} + P_{\text{Sentinel}} = 30 - 23 = \mathbf{7} \text{ points}

  • Aegis Alliance has D=1D = 1 (table), so PAegisP_{\text{Aegis}} must be an odd integer.

  • Clue (iv) states Aegis Alliance defeated Cerberus Sec (WAegis≥1W_{\text{Aegis}} \ge 1). Thus PAegis≥2(1)+1=3P_{\text{Aegis}} \ge 2(1) + 1 = 3.

  • Because all points are distinct, PAegis≠3P_{\text{Aegis}} \ne 3 (Cerberus has 3), PAegis≠7P_{\text{Aegis}} \ne 7 (Echo has 7), and PAegis≠9P_{\text{Aegis}} \ne 9 (Daedalus has 9).

  • Therefore, the ONLY possible odd integer for Aegis Alliance is 5!

    PAegis=5(W=2,D=1,L=2)P_{\text{Aegis}} = \mathbf{5} \quad (W=2, D=1, L=2)

  • Consequently, Sentinel Ops must have:

    PSentinel=7−5=2 points(W=1,D=0,L=4)P_{\text{Sentinel}} = 7 - 5 = \mathbf{2} \text{ points} \quad (W=1, D=0, L=4)

  • Check distinctness: Standings are 9, 7, 5, 4, 3, 2. All six point totals are strictly distinct!

  • Clue (i) is satisfied: Sentinel Ops (2 pts) is the unique minimum, so Cerberus Sec (3 pts) did not finish minimum.

  • The required difference in Question 9 is ∣PAegis−PSentinel∣=5−2=3|P_{\text{Aegis}} - P_{\text{Sentinel}}| = 5 - 2 = \mathbf{3}. Correct Choice: (2)

Step 5: Complete Tournament Reconciliation & Draws

  • Total draws in the tournament: Clue (v) states Mdraw≤2M_{\text{draw}} \le 2.

  • We know Aegis drew with Daedalus (Draw #1).

  • Echo Labs has 7 points   ⟹  2W+D=7  ⟹  W=3,D=1,L=1\implies 2W + D = 7 \implies W=3, D=1, L=1.

  • Cerberus Sec has 3 points   ⟹  W=1,D=1,L=3\implies W=1, D=1, L=3.

  • Since each draw requires two teams, Draw #2 must be between Echo Labs and Cerberus Sec!

  • No other draws exist in the tournament (Mdraw=2M_{\text{draw}} = 2).

Step 6: Trace Individual Matches

  • Daedalus Net (4W, 1D, 0L): Drew with Aegis; won against Echo, Bastion, Cerberus, and Sentinel.

  • Echo Labs (3W, 1D, 1L): Drew with Cerberus; lost to Daedalus; won against Aegis, Bastion, and Sentinel.

  • Cerberus Sec (1W, 1D, 3L): Drew with Echo; lost to Daedalus and Aegis; won against Sentinel Ops (min team). Therefore, Cerberus lost to Bastion!

  • Now examine the 3-team sub-league among Aegis Alliance, Bastion Cyber, and Sentinel Ops:

    • Aegis: Total 2W, 1D, 2L. Outside this triad, Aegis has 1D (Daedalus), 1L (Echo), 1W (Cerberus). Within the triad, Aegis must have 1W and 1L.

    • Bastion: Total 2W, 0D, 3L. Outside this triad, Bastion lost to Daedalus and Echo, and beat Cerberus (1W, 2L). Within the triad, Bastion must have 1W and 1L.

    • Sentinel: Total 1W, 0D, 4L. Outside this triad, Sentinel lost to Daedalus, Echo, and Cerberus (0W, 3L). Within the triad, Sentinel must have 1W and 1L.

  • Thus, the three matches among Aegis, Bastion, and Sentinel form a cyclic 3-way triangle:

    • Cycle 1: Aegis beats Sentinel, Sentinel beats Bastion, Bastion beats Aegis.

    • Cycle 2: Aegis beats Bastion, Bastion beats Sentinel, Sentinel beats Aegis.

Question 11 Sufficiency Analysis:

  • Statement (1): The only syndicate that lost against Cerberus Sec (Sentinel Ops) defeated Aegis Alliance.

    This forces Sentinel > Aegis, fixing Cycle 2 uniquely! Sufficient.

  • Statement (3): Aegis Alliance defeated Sentinel Ops.

    This forces Aegis > Sentinel, fixing Cycle 1 uniquely! Sufficient.

  • Statement (2) provides no new information since Echo Labs already defeated Sentinel Ops in both cycles.

Hence, both (1) and (3) alone are sufficient. Correct Choice: (4)

Solved Example Set 4: Questions 13 to 16 (Autonomous Drone Superleague — Double Round-Robin & Net Lap Rate)

Directions for Examples 13 to 16

Three high-performance autonomous drone racing teams — AeroCore, SkyFalcon, and PulseJet — participated in the Autonomous Drone Superleague (ADSL) Invitational, in which each team competed against every other team twice (a double round-robin tournament of 6 total matches).

Each match comprised two autonomous flight heats (one flown by each team), each lasting an allocated benchmark duration of 20 minutes.

  • The Lap Rate (LR) of a team for an individual heat is calculated by dividing the number of completed laps by 20.

  • The Net Lap Rate (NLR) of a team for a match is calculated by subtracting the opponent's LR from its own LR:

    NLR=Own LR−Opponent LR=Laps Scored−Laps Conceded20\text{NLR} = \text{Own LR} - \text{Opponent LR} = \frac{\text{Laps Scored} - \text{Laps Conceded}}{20}

  • The Total Net Lap Rate (TNLR) of a team is the sum of its NLR values across the four matches in which it participated.

  • No match in the tournament ended in a tie. It is also known that:

    I. No two teams won the same number of matches in the tournament.

    II. The TNLR of SkyFalcon, which completed a total of 972 laps across the tournament, was -6.90.

    III. 180, 330, and 210 were the lap totals of some of the heats in the tournament.

    IV. 15.50 was the Lap Rate of a team in an individual heat of the tournament.

    V. The highest Lap Rate of PulseJet in a heat was thrice its lowest Lap Rate in a heat in the tournament.

    VI. AeroCore and SkyFalcon completed 340 and 312 laps respectively in their first encounter, and 280 and 230 laps (in that order) in their second encounter.

    VII. SkyFalcon won exactly one match, in which its NLR was +2.00, against PulseJet.

    VIII. PulseJet, whose NLR in one of the matches was -6.50, was the only team that completed more than 300 laps twice.


Question 13: In the tournament, what was the total number of laps completed by PulseJet across its four heats put together?

(1) 924

(2) 930

(3) 906

(4) 896

Question 14: What was the Net Lap Rate (NLR) of SkyFalcon against PulseJet in the match that SkyFalcon lost?

(1) -5.00

(2) -4.90

(3) -3.90

(4) -2.45

Question 15: What was the lap score of AeroCore against PulseJet in the match that AeroCore won?

(1) 240

(2) 245

(3) 180

(4) Cannot be determined

Question 16: What was the minimum score completed by PulseJet in an individual heat of the tournament?

(1) 180

(2) 140

(3) 110

(4) 105

Show solution

Step-by-Step Deductive Analysis

Step 1: Tournament Match Structure & Win Distribution

  • Total matches M=3×2=6M = 3 \times 2 = 6 matches. Each team participates in 4 matches.

  • Statement I states: No two teams won the same number of matches.

  • Since the sum of wins equals 6 and all win counts are distinct non-negative integers ≤4\le 4, the win counts must strictly be 3, 2, and 1.

  • Statement VI reveals AeroCore defeated SkyFalcon in both their encounters (340 vs 312, and 280 vs 230).

  • Statement VII states SkyFalcon won exactly 1 match (against PulseJet). Thus, SkyFalcon has 1 win.

  • Hence, AeroCore has 3 wins, PulseJet has 2 wins, and SkyFalcon has 1 win.

Step 2: PulseJet's High and Low Scores

  • Statement VIII states PulseJet was the ONLY team that completed more than 300 laps twice.

  • We know from Statement III that 330 was a heat score. From Statement IV, a Lap Rate of 15.50 corresponds to:

    Laps=15.50×20=310 laps\text{Laps} = 15.50 \times 20 = 310 \text{ laps}

  • Since AeroCore and SkyFalcon only scored > 300 once (in their first match: 340 and 312), both 330 and 310 must belong to PulseJet!

  • Thus, PulseJet's highest score was 330 laps.

  • Statement V states PulseJet's highest Lap Rate was thrice its lowest Lap Rate:

    Lowest PulseJet Score=3303=110 laps\text{Lowest PulseJet Score} = \frac{330}{3} = \mathbf{110} \text{ laps}

    This directly answers Question 16: 110 laps (Option 3).

Step 3: SkyFalcon's Run Margin & Defeat to PulseJet

  • Statement II gives SkyFalcon's Total Net Lap Rate (TNLR) as -6.90:

    Total Lap Margin=TNLR×20=−6.90×20=−138 laps\text{Total Lap Margin} = \text{TNLR} \times 20 = -6.90 \times 20 = -138 \text{ laps}

  • Calculate SkyFalcon's margins in its first three known matches:

    • Match 1 vs AeroCore: 312−340=−28312 - 340 = -28 laps

    • Match 2 vs AeroCore: 230−280=−50230 - 280 = -50 laps

    • Match 3 vs PulseJet (won by SkyFalcon, Clue VII): NLR=+2.00  ⟹  +2.00×20=+40\text{NLR} = +2.00 \implies +2.00 \times 20 = +40 laps

  • Sum of margins across these three matches: −28−50+40=−38-28 - 50 + 40 = -38 laps.

  • Therefore, SkyFalcon's margin in its 4th match (the match lost against PulseJet) is:

    Margin=−138−(−38)=−100 laps\text{Margin} = -138 - (-38) = \mathbf{-100} \text{ laps}

  • SkyFalcon lost to PulseJet by exactly 100 laps. Its NLR in this match was:

    NLR=−10020=−5.00\text{NLR} = \frac{-100}{20} = \mathbf{-5.00}

    This immediately answers Question 14: -5.00 (Option 1).

Step 4: Reconstruct Exact Scores in PulseJet vs SkyFalcon Matches

  • In the match where PulseJet beat SkyFalcon by 100 laps:

    PulseJet scored either 310 or 330. If PulseJet scored 310, SkyFalcon scored 310−100=210310 - 100 = 210 laps (which matches the 210 in Clue III!).

  • Statement II states SkyFalcon scored a total of 972 laps across the tournament:

    Laps in Match Won vs PulseJet=972−(312+230+210)=972−752=220 laps\text{Laps in Match Won vs PulseJet} = 972 - (312 + 230 + 210) = 972 - 752 = \mathbf{220} \text{ laps}

  • Because SkyFalcon won this match by 40 laps, PulseJet's score was:

    PulseJet Score=220−40=180 laps\text{PulseJet Score} = 220 - 40 = \mathbf{180} \text{ laps}

    This perfectly matches the 180 in Statement III!

Step 5: PulseJet vs AeroCore Matches

  • PulseJet's four heat scores are: 330, 310, 180, and 110.

  • PulseJet played AeroCore twice:

    • In one match, PulseJet scored its minimum of 110 laps and lost to AeroCore.

    • Statement VIII states PulseJet's NLR in one match was -6.50 (a deficit of −6.50×20=−130-6.50 \times 20 = -130 laps).

    • Thus, AeroCore scored: 110+130=240 laps110 + 130 = \mathbf{240} \text{ laps}!

    • In the other match, PulseJet scored 330 laps and defeated AeroCore (giving PulseJet its second win).

Step 6: Summary of All 6 Matches

MatchCompetitors & ScoresWinner & Margin
Match 1AeroCore (340) vs SkyFalcon (312)AeroCore won by 28 laps
Match 2AeroCore (280) vs SkyFalcon (230)AeroCore won by 50 laps
Match 3PulseJet (310) vs SkyFalcon (210)PulseJet won by 100 laps
Match 4SkyFalcon (220) vs PulseJet (180)SkyFalcon won by 40 laps
Match 5AeroCore (240) vs PulseJet (110)AeroCore won by 130 laps
Match 6PulseJet (330) vs AeroCore (X < 330)PulseJet won

Answers to Questions:

Question 13: Total laps completed by PulseJet across its four heats:

Total=330+310+180+110=930 laps\text{Total} = 330 + 310 + 180 + 110 = \mathbf{930} \text{ laps}

Correct Choice: (2) 930

Question 14: Net Lap Rate of SkyFalcon against PulseJet in the lost match:

NLR=210−31020=−5.00\text{NLR} = \frac{210 - 310}{20} = \mathbf{-5.00}

Correct Choice: (1) -5.00

Question 15: Score of AeroCore against PulseJet in the match AeroCore won: 240 laps. Correct Choice: (1) 240

Question 16: Minimum score of PulseJet in an individual heat: 110 laps. Correct Choice: (3) 110

Solved Example Set 5: Questions 17 to 20 (Quantum Hardware Security Probing — 4-Register Cryptographic Enclave)

Directions for Examples 17 to 20

A hardware security auditor is auditing a high-security cryptographic enclave. The enclave contains four secret hardware registers, designated from left to right as R1,R2,R3,R_1, R_2, R_3, and R4R_4.

Each register stores a distinct single-digit positive integer:

  • Exactly three of the four registers store distinct single-digit, composite even numbers.

  • Exactly one register stores a single-digit, non-even prime number.

The auditor can send a 4-bit binary test vector (b1,b2,b3,b4)∈{0,1}4(b_1, b_2, b_3, b_4) \in \{0, 1\}^4 as an input to the enclave's diagnostic port. The enclave multiplies each bit by the value in the corresponding register from left to right and outputs the inner product in standard decimal notation:

Output=b1R1+b2R2+b3R3+b4R4\text{Output} = b_1 R_1 + b_2 R_2 + b_3 R_3 + b_4 R_4

The auditor observes both the binary input vector and the decimal output response. When an input vector is specified in decimal notation, it is converted to its 4-bit binary representation by prefixing leading zeros if necessary (for example, decimal 3 is encoded as 001120011_2, which computes 0×R1+0×R2+1×R3+1×R40 \times R_1 + 0 \times R_2 + 1 \times R_3 + 1 \times R_4).


Question 17: Which of the following sets of decimal input vectors would together be sufficient to individually determine the exact number stored in each of the four registers?

(1) 1, 2, 4, and 8

(2) 7, 5, 1, and 2

(3) 3, 2, 1, and 4

(4) 3, 3, 1, and 2

Question 18: If the auditor sends the binary equivalent of decimal 15 as input to the enclave and receives 23 as the output response, what is the prime key stored in the enclave?

(1) 3

(2) 5

(3) 7

(4) 2

Question 19: If the prime key is known to be 5 and is stored in register R4R_4, and the decimal notation of the input test vector is 14, which of the following is the output response?

(1) 20

(2) 22

(3) 24

(4) 18

Question 20: If the auditor sends test vector 15 (111121111_2) and receives 23, and subsequently sends test vector 7 (011120111_2) and receives 17, what is the exact value stored in register R1R_1?

(1) 4

(2) 6

(3) 8

(4) 5

Show solution

Step-by-Step Deductive Analysis

Fundamental Domain Restrictions

  1. Single-digit composite even numbers: The single-digit even numbers are 2, 4, 6, 8. Since 2 is prime, the only single-digit, non-prime (composite) even numbers are 4, 6, and 8.

    Because three registers store distinct composite even numbers, the values {4,6,8}\{4, 6, 8\} MUST all be present in three of the four registers!

    The sum of these three composite even registers is strictly invariant:

    Sum of Composite Evens=4+6+8=18\text{Sum of Composite Evens} = 4 + 6 + 8 = \mathbf{18}

  2. Single-digit non-even prime key: The single-digit prime numbers are 2, 3, 5, 7. The non-even (odd) primes are 3, 5, or 7.

    Thus, the fourth register stores a key P∈{3,5,7}P \in \{3, 5, 7\}.

Question 17 Analysis:

  • To determine the value in register R4R_4 directly, send (0,0,0,1)=00012=110(0, 0, 0, 1) = 0001_2 = \mathbf{1}_{10}. Response =R4= R_4.

  • To determine the value in register R3R_3 directly, send (0,0,1,0)=00102=210(0, 0, 1, 0) = 0010_2 = \mathbf{2}_{10}. Response =R3= R_3.

  • To determine the value in register R2R_2 directly, send (0,1,0,0)=01002=410(0, 1, 0, 0) = 0100_2 = \mathbf{4}_{10}. Response =R2= R_2.

  • To determine the value in register R1R_1 directly, send (1,0,0,0)=10002=810(1, 0, 0, 0) = 1000_2 = \mathbf{8}_{10}. Response =R1= R_1.

  • These four standard basis vectors linearly isolate each register independently without cross-interference.

Correct Choice: (1) 1, 2, 4, and 8

Question 18 Analysis:

  • Decimal 15 corresponds to binary 111121111_2.

  • Input vector (1,1,1,1)(1, 1, 1, 1) computes the sum of all four registers:

    R1+R2+R3+R4=23R_1 + R_2 + R_3 + R_4 = 23

  • We know the three composite even registers contribute exactly 4+6+8=184 + 6 + 8 = 18.

  • Therefore, the prime key PP is:

    P=23−18=5P = 23 - 18 = \mathbf{5}

Correct Choice: (2) 5

Question 19 Analysis:

  • Decimal 14 corresponds to binary 111021110_2.

  • The vector (1,1,1,0)(1, 1, 1, 0) multiplies: 1×R1+1×R2+1×R3+0×R4=R1+R2+R31 \times R_1 + 1 \times R_2 + 1 \times R_3 + 0 \times R_4 = R_1 + R_2 + R_3.

  • We are given that register R4=5R_4 = 5 (the prime key). Therefore, registers R1,R2,R_1, R_2, and R3R_3 MUST hold the three composite even numbers {4,6,8}\{4, 6, 8\} in some order.

  • Regardless of which specific register holds which even number, their sum is invariant:

    Output=4+6+8+0×5=18\text{Output} = 4 + 6 + 8 + 0 \times 5 = \mathbf{18}

Correct Choice: (4) 18

Question 20 Analysis:

  • Input 15 (111121111_2) yields: R1+R2+R3+R4=23R_1 + R_2 + R_3 + R_4 = 23.

  • Input 7 (011120111_2) yields: 0×R1+R2+R3+R4=R2+R3+R4=170 \times R_1 + R_2 + R_3 + R_4 = R_2 + R_3 + R_4 = 17.

  • Subtracting the second equation directly from the first:

    R1=(R1+R2+R3+R4)−(R2+R3+R4)=23−17=6R_1 = (R_1 + R_2 + R_3 + R_4) - (R_2 + R_3 + R_4) = 23 - 17 = \mathbf{6}

  • Register R1R_1 holds the value 6.

Correct Choice: (2) 6

Practice questions

Question 1 · Foundation

Foundational Concept: Tournament Points Conservation

In an eight-team single round-robin cyber wargame league, each team competed against every other team exactly once. Points were awarded as follows: 3 points for a win, 0 points for a loss, and 1 point to each team for a drawn match.

If the sum of the points earned by all eight teams at the end of the championship was 76, how many matches in the tournament ended in a draw?

  1. A

    6 matches

  2. B

    8 matches

  3. C

    10 matches

  4. D

    12 matches

Show answer and explanation

Answer: (B) 8 matches

Step 1: Total matches played

For N=8N = 8 teams in a single round-robin tournament, the total number of matches is:

M=8×72=28 matchesM = \frac{8 \times 7}{2} = 28 \text{ matches}

Step 2: Total points conservation in a 3-point system

  • In a decisive match (win/loss), total points awarded to the two teams =3+0=3= 3 + 0 = 3 points.

  • In a drawn match, total points awarded to the two teams =1+1=2= 1 + 1 = 2 points.

Thus, every draw reduces the total points pool by exactly 3−2=13 - 2 = 1 point below the theoretical maximum.

Step 3: Calculate the draw deficit

If all 28 matches had been decisive, the total points would be:

Maximum Points=28×3=84 points\text{Maximum Points} = 28 \times 3 = 84 \text{ points}

Given that the actual total points earned was 76:

Number of Drawn Matches=84−76=8 matches\text{Number of Drawn Matches} = 84 - 76 = \mathbf{8} \text{ matches}

Verification: 8 drawn matches award 8×2=168 \times 2 = 16 points; 20 decisive matches award 20×3=6020 \times 3 = 60 points. Total points =16+60=76= 16 + 60 = 76. Total matches =8+20=28= 8 + 20 = 28.

Question 2 · Foundation

Foundational Concept: Seeded Knockout Bracket Structure

A standard 32-player single-elimination seeded knockout championship seeds players from Seed 1 (top seed) to Seed 32. In Round 1, Match kk pairs Seed kk with Seed (33−k)(33 - k) for k=1,2,…,16k = 1, 2, \dots, 16. In subsequent rounds, winners advance along standard complementary bracket paths (Winner of Match kk plays Winner of Match 17−k17 - k in Round 2, and so on).

If Seed 21 successfully advanced to the Quarterfinals (Round of 8), what is the highest-ranked seed (lowest numerical seed) it could possibly face in its Quarterfinal match?

  1. A

    Seed 1

  2. B

    Seed 4

  3. C

    Seed 5

  4. D

    Seed 8

Show answer and explanation

Answer: (B) Seed 4

Step 1: Trace Seed 21 in the Round 1 bracket

  • In Round 1, Seed 21 plays in Match 12, because 33−21=1233 - 21 = 12. Thus Match 12 is Seed 12 vs Seed 21.

Step 2: Trace Round 2 pairing

  • In Round 2, Winner of Match 12 plays Winner of Match 17−12=517 - 12 = 5.

  • Match 5 in Round 1 was between Seed 5 and Seed (33−5)=28(33 - 5) = 28.

  • Seed 21 defeats Seed 12 in R1, and then defeats either Seed 5 or Seed 28 in R2 to reach the Quarterfinals.

Step 3: Identify Quarterfinal opponents

  • In the Quarterfinals (Round 3), the survivor of the (12, 21, 5, 28) pod plays the survivor of the adjacent sibling pod in the same quarter of the draw.

  • That sibling pod originates from Round 2 Match 9−5=49 - 5 = 4.

  • Round 2 Match 4 brings together Round 1 Match 4 (Seed 4 vs Seed 29) and Round 1 Match 17−4=1317 - 4 = 13 (Seed 13 vs Seed 20).

  • Therefore, the four seeds in that sibling pod are {4,29,13,20}\{4, 29, 13, 20\}.

  • The highest-ranked player among these candidates is Seed 4.

If Seed 4 wins its Round 1 and Round 2 matches, Seed 21 will face Seed 4 in the Quarterfinals.

Question 3 · Foundation

Foundational Concept: Net Run Rate Mechanics

In a 4-team T20 cricket tournament, each team played 3 matches of 20 overs per innings. In Match 1, Team Alpha scored 180 runs and conceded 160 runs. In Match 2, Team Alpha scored 140 runs and conceded 170 runs.

If Team Alpha finished the group stage with a Total Net Run Rate (TNRR) of +0.25 across its 3 completed matches, and scored 195 runs in Match 3, how many runs did Team Alpha concede in Match 3?

  1. A

    165 runs

  2. B

    170 runs

  3. C

    175 runs

  4. D

    180 runs

Show answer and explanation

Answer: (B) 170 runs

Step 1: Understand TNRR over equal completed overs

Team Alpha played 3 matches of 20 overs each, facing a total of 3×20=603 \times 20 = 60 overs and bowling 60 overs.

TNRR=Total Runs Scored−Total Runs ConcededTotal Overs=Rscored−Rconceded60\text{TNRR} = \frac{\text{Total Runs Scored} - \text{Total Runs Conceded}}{\text{Total Overs}} = \frac{R_{\text{scored}} - R_{\text{conceded}}}{60}

Step 2: Relate TNRR to overall run margin

Given TNRR=+0.25\text{TNRR} = +0.25:

Rscored−Rconceded=+0.25×60=+15 runsR_{\text{scored}} - R_{\text{conceded}} = +0.25 \times 60 = +15 \text{ runs}

Step 3: Sum runs scored and find runs conceded

  • Total runs scored by Alpha =180+140+195=515= 180 + 140 + 195 = 515 runs.

  • Total runs conceded by Alpha =515−15=500= 515 - 15 = 500 runs.

  • Runs conceded in Matches 1 and 2 =160+170=330= 160 + 170 = 330 runs.

  • Therefore, runs conceded in Match 3 is:

Rconceded, M3=500−330=170 runsR_{\text{conceded, M3}} = 500 - 330 = \mathbf{170} \text{ runs}

Verification:

  • NRR Match 1: (180−160)/20=+1.00(180 - 160)/20 = +1.00

  • NRR Match 2: (140−170)/20=−1.50(140 - 170)/20 = -1.50

  • NRR Match 3: (195−170)/20=+0.75(195 - 170)/20 = +0.75

TNRR=+1.00−1.50+0.75=+0.25\text{TNRR} = +1.00 - 1.50 + 0.75 = +0.25

Question 4 · Foundation

Foundational Concept: Upsets in Single-Elimination Knockouts

In a 16-player single-elimination knockout tournament seeded 1 to 16, an upset is defined as any match where a player with a higher numerical seed (lower ranking) defeats a player with a lower numerical seed (higher ranking).

If Seed 10 won the championship, what was the absolute minimum number of upsets that must have occurred across the entire 15-match tournament?

  1. A

    2

  2. B

    3

  3. C

    4

  4. D

    5

Show answer and explanation

Answer: (C) 4

Step 1: Total rounds in a 16-player tournament

With N=16=24N = 16 = 2^4, the tournament comprises log⁡216=4\log_2 16 = 4 rounds: Round of 16, Quarterfinals, Semifinals, and Final.

Step 2: Trace Seed 10's path

To minimize the total upsets across the tournament, assume that every match NOT involving Seed 10 is won by the higher-ranked seed.

  • Round 1 (Round of 16): Seed 10 plays Seed 17−10=717 - 10 = 7. Since 7<107 < 10, Seed 7 is higher-ranked. For Seed 10 to win, this match must be an upset (Upset #1).

  • Round 2 (Quarterfinals): Seed 10 plays the winner of Match 2 (Seed 2 vs Seed 15). If Seed 2 won (no upset), Seed 10 faces Seed 2. Since 2<102 < 10, Seed 10 defeating Seed 2 must be an upset (Upset #2).

  • Round 3 (Semifinals): Seed 10 plays the survivor of the other quarter in the bottom half (Seeds 3, 14, 6, 11). The top seed in that quarter is Seed 3. If Seed 3 advances, Seed 10 faces Seed 3. Since 3<103 < 10, Seed 10 defeating Seed 3 must be an upset (Upset #3).

  • Round 4 (Final): Seed 10 plays the survivor of the top half (where Seeds 1, 4, 5, 8 reside). The top seed is Seed 1. If Seed 1 advances, Seed 10 faces Seed 1. Since 1<101 < 10, Seed 10 defeating Seed 1 must be an upset (Upset #4).

Could an earlier match in Seed 10's path be won by a lower seed (e.g., Seed 15 beats Seed 2)?

If Seed 15 beats Seed 2, that match itself is an upset, so the upset count in that round remains at least 1!

Since Seed 10 is seeded 10, in every single round its opponent's branch is seeded higher than 10 (top seeds are 7, 2, 3, 1). Thus, at least one upset is strictly required in each of the 4 rounds.

Therefore, the absolute minimum number of upsets is 4.

Question 5 · Foundation

Foundational Concept: League Table Parity & Score Partitioning

Five teams (A, B, C, D, and E) competed in a single round-robin soccer tournament (10 total matches). Points were awarded as follows: 3 points for a win, 0 points for a loss, and 1 point to each team for a draw. Team A played 4 matches, winning 3 and drawing 1, finishing with 10 points.

If all the remaining four teams (B, C, D, and E) finished the tournament with identical total points, what is the maximum possible number of points each of the other four teams could have earned?

  1. A

    3 points

  2. B

    4 points

  3. C

    5 points

  4. D

    6 points

Show answer and explanation

Answer: (B) 4 points

Step 1: Analyze points distributed in matches involving Team A

Team A played 4 matches:

  • In 3 matches won by Team A, Team A earned 3×3=93 \times 3 = 9 points, while its opponents earned 0 points.

  • In 1 match drawn by Team A, Team A earned 1 point, and that specific opponent earned 1 point.

Thus, among teams B, C, D, and E, exactly one team received 1 point from Team A, while the other three received 0 points from Team A.

Step 2: Points available from matches strictly among B, C, D, and E

There are (42)=6\binom{4}{2} = 6 matches played among B, C, D, and E.

  • In a 3-point system, each match yields at most 3 points (if decisive).

  • Total points generated among B, C, D, and E is at most 6×3=186 \times 3 = 18 points.

  • Adding the 1 point earned from the draw with Team A, the total points available to B, C, D, and E across the entire tournament is at most:

Total Points≤18+1=19 points\text{Total Points} \le 18 + 1 = 19 \text{ points}

Step 3: Equal point condition

Let the common point total of each of the four teams be PP.

4P≤19  ⟹  P≤4.754P \le 19 \implies P \le 4.75

Since points must be an integer, P≤4P \le 4.

Step 4: Verify achievability of P=4P = 4

Can all four teams achieve 4 points?

  • Let Team B draw with Team A (giving B 1 point).

  • In the matches among B, C, D, and E:

    • Team B draws with C, D, and E (earning 3 points from 3 draws   ⟹  \implies total 1+3=41 + 3 = 4 points).

    • Team C beats D, loses to E, and draws with B (earning 3+0+1=43 + 0 + 1 = 4 points).

    • Team D beats E, loses to C, and draws with B (earning 3+0+1=43 + 0 + 1 = 4 points).

    • Team E beats C, loses to D, and draws with B (earning 3+0+1=43 + 0 + 1 = 4 points).

All four teams finish with exactly 4 points! Thus, the maximum points each could earn is 4 points.

Try real CAT questions

Study this concept with interactive practice in PrepSoc.

Open the concept library