Free CAT library

Caselet: Concepts & Solved Examples

Master textual caselets, 2-set and 3-set Venn diagrams, matrix reconstructions, maxima-minima set boundaries, and constraint mapping.

Comprehensive Conceptual Framework: Caselets & Set-Based Deduction

A Caselet is an unstructured, paragraph-based data interpretation and logical reasoning set where no pre-rendered visual charts or complete data matrices are provided. Instead, complex mathematical information, demographic partitions, business transactions, or sequential operations are embedded entirely within dense descriptive text.

In the CAT (Common Admission Test) and IPMAT examinations, Caselets represent one of the most intellectually demanding formats because they demand a dual cognitive pipeline:

  1. Data Structuring & Schematization: Translating raw prose into formal mathematical schemas (Venn diagrams, contingency grids, or systems of equations).

  2. Constrained Deduction & Optimization: Navigating incomplete information through Diophantine constraints, parity filters, and min-max set optimization.


1. Taxonomy of Caselets

Caselets broadly fall into four canonical structural archetypes:


flowchart TD

    Caselets["Caselet Typologies"]

    Caselets --> SetTheory["1. Set-Theoretic (Venn)"]

    Caselets --> MatrixGrid["2. Matrix & Contingency Grids"]

    Caselets --> EquationBased["3. Equation & Integer Systems"]

    Caselets --> Sequential["4. Multi-Period & Tournaments"]
    
    SetTheory --> TwoSet["2-Set Overlaps & Complements"]

    SetTheory --> ThreeSet["3-Set Canonical Partitions"]

    SetTheory --> FourSet["4-Set Binary Hypercubes"]

    SetTheory --> MinMax["Min-Max Intersection Bounds"]
    
    MatrixGrid --> Sudoku["Cross-Product Reconstructions"]

    MatrixGrid --> Ledger["Inflow-Outflow Balance Ledgers"]
    
    EquationBased --> Parity["Square / Cube / Parity Pruning"]

    EquationBased --> Diophantine["Integer Diophantine Equations"]
    
    Sequential --> Replacement["Cohort Replacement Lifecycles"]

    Sequential --> PointsPool["Round-by-Round Invariant Pools"]


2. Set Theory & Venn Diagram Formulations

Set-theoretic caselets deal with overlapping cohorts across discrete categories (e.g., subscribers, students, voters, products).

A. Two-Set Venn Architecture

Let the universal set be UU, with two overlapping subsets AA and BB, and a complement set of elements belonging to neither category denoted by N0=(A∪B)cN_0 = (A \cup B)^c:

∣U∣=∣A∪B∣+N0|U| = |A \cup B| + N_0

∣A∪B∣=∣A∣+∣B∣−∣A∩B∣|A \cup B| = |A| + |B| - |A \cap B|

Only A=∣A∖B∣=∣A∣−∣A∩B∣\text{Only } A = |A \setminus B| = |A| - |A \cap B|

Exactly One Set=(∣A∣−∣A∩B∣)+(∣B∣−∣A∩B∣)=∣A∪B∣−∣A∩B∣\text{Exactly One Set} = (|A| - |A \cap B|) + (|B| - |A \cap B|) = |A \cup B| - |A \cap B|

B. Three-Set Venn Architecture (Canonical Disjoint Partitions)

For three interacting sets A,BA, B, and CC, the universe of elements belonging to at least one set can be partitioned into mutually exclusive components:

  • Exactly One Category (II): a+b+ca + b + c, where:

    a=∣A∖(B∪C)∣,b=∣B∖(A∪C)∣,c=∣C∖(A∪B)∣a = |A \setminus (B \cup C)|, \quad b = |B \setminus (A \cup C)|, \quad c = |C \setminus (A \cup B)|

  • Exactly Two Categories (IIII): d+e+fd + e + f, where:

    d=∣(A∩B)∖C∣,e=∣(B∩C)∖A∣,f=∣(A∩C)∖B∣d = |(A \cap B) \setminus C|, \quad e = |(B \cap C) \setminus A|, \quad f = |(A \cap C) \setminus B|

  • All Three Categories (IIIIII): g=∣A∩B∩C∣g = |A \cap B \cap C|

  • None (N0N_0): Elements belonging to none of A,B,CA, B, C.

The fundamental structural identities are:

  1. Total Union:

    ∣A∪B∪C∣=I+II+III|A \cup B \cup C| = I + II + III

  2. Sum of Individual Set Cardinalities:

    ∑∣A∣=∣A∣+∣B∣+∣C∣=I+2(II)+3(III)\sum |A| = |A| + |B| + |C| = I + 2(II) + 3(III)

  3. Sum of Pairwise Intersections:

    ∑∣A∩B∣=∣A∩B∣+∣B∩C∣+∣C∩A∣=II+3(III)\sum |A \cap B| = |A \cap B| + |B \cap C| + |C \cap A| = II + 3(III)

  4. Principle of Inclusion-Exclusion (PIE):

    ∣A∪B∪C∣=∑∣A∣−∑∣A∩B∣+∣A∩B∩C∣|A \cup B \cup C| = \sum |A| - \sum |A \cap B| + |A \cap B \cap C|

C. Master Transformation Identities

By subtracting equations, we obtain two foundational algebraic invariants crucial for fast solving:

(I+2II+3III)−(I+II+III)  ⟹  II+2(III)=∑∣A∣−∣A∪B∪C∣(I + 2 II + 3 III) - (I + II + III) \implies II + 2(III) = \sum |A| - |A \cup B \cup C|

2(I+II+III)−(I+2II+3III)  ⟹  I−III=2∣A∪B∪C∣−∑∣A∣2(I + II + III) - (I + 2 II + 3 III) \implies I - III = 2|A \cup B \cup C| - \sum |A|

At least two categories=II+III=∑∣A∩B∣−2(III)\text{At least two categories} = II + III = \sum |A \cap B| - 2(III)

D. Four-Set Systems: Why Circles Fail

It is a proven topological theorem (Venn, 1880) that four symmetric circles in a 2D plane cannot display all 24=162^4 = 16 possible intersections without creating false empty regions. For 4-attribute caselets (e.g., A,B,C,DA, B, C, D), use:

  1. Interlocking congruent ellipses, or

  2. A 2×2×2×22 \times 2 \times 2 \times 2 Binary Contingency Matrix (Karnaugh layout).


3. Maximization and Minimization in Sets (Min-Max Optimization)

A recurring CAT favorite involves scenarios where individual set totals are fixed, but overlap sizes are unstated, requiring you to establish mathematical upper and lower bounds.

A. Two-Set Intersection Bounds (Fréchet Bounds)

Given sets AA and BB in a finite universe UU:

max⁡(0,∣A∣+∣B∣−∣U∣)≤∣A∩B∣≤min⁡(∣A∣,∣B∣)\max(0, |A| + |B| - |U|) \le |A \cap B| \le \min(|A|, |B|)

B. Multi-Set Generalized Overlap Lower Bound (Bonferroni / Fréchet)

For kk subsets A1,A2,…,AkA_1, A_2, \dots, A_k defined over a universe UU:

∣⋂i=1kAi∣≥∑i=1k∣Ai∣−(k−1)∣U∣|\bigcap_{i=1}^k A_i| \ge \sum_{i=1}^k |A_i| - (k - 1)|U|

Proof via De Morgan's Law:

∣⋂i=1kAi∣=∣U∣−∣⋃i=1kAic∣≥∣U∣−∑i=1k∣Aic∣=∣U∣−∑i=1k(∣U∣−∣Ai∣)=∑i=1k∣Ai∣−(k−1)∣U∣|\bigcap_{i=1}^k A_i| = |U| - |\bigcup_{i=1}^k A_i^c| \ge |U| - \sum_{i=1}^k |A_i^c| = |U| - \sum_{i=1}^k (|U| - |A_i|) = \sum_{i=1}^k |A_i| - (k - 1)|U|

For 3 sets:

min⁡(∣A∩B∩C∣)=max⁡(0,∣A∣+∣B∣+∣C∣−2∣U∣)\min(|A \cap B \cap C|) = \max(0, |A| + |B| + |C| - 2|U|)

C. Optimization in Three-Set Venn Diagrams

Using the identity II+2(III)=∑∣A∣−∣A∪B∪C∣=Constant KII + 2(III) = \sum |A| - |A \cup B \cup C| = \text{Constant } K:

  • To Maximize All Three (IIImax⁡III_{\max}): Depress IIII (exactly two) to its absolute minimal allowable integer value (IImin⁡≥0II_{\min} \ge 0). Then III≤⌊K/2⌋III \le \lfloor K / 2 \rfloor, subject to III≤min⁡(∣A∣,∣B∣,∣C∣)III \le \min(|A|, |B|, |C|).

  • To Maximize Exactly Two (IImax⁡II_{\max}): Depress IIIIII (all three) to its minimal allowable value (IIImin⁡≥0III_{\min} \ge 0). If III=0III = 0 is feasible, IImax⁡=KII_{\max} = K.

  • To Minimize At Least One / Maximize Exactly One (II): Evaluate I=2∣A∪B∪C∣−∑∣A∣+IIII = 2|A \cup B \cup C| - \sum |A| + III. Maximizing II requires maximizing IIIIII.


4. Matrix & Contingency Grid Reconstructions

When a caselet describes entities having multiple non-overlapping attributes (e.g., Candidates ×\times Questions, Funds ×\times [Started, Spent, Ended], Quarters ×\times Analysts):

  1. Orthogonal Variable Mapping: Construct a 2D cross-grid where rows represent one entity class and columns represent another.

  2. Conservation of Margins:

    ∑columnsRowi=Ri,∑rowsColj=Cj,∑Ri=∑Cj=Grand Total\sum_{\text{columns}} \text{Row}_i = R_i, \quad \sum_{\text{rows}} \text{Col}_j = C_j, \quad \sum R_i = \sum C_j = \text{Grand Total}

  3. Transaction Ledgers (Flow Conservation): In financial or inventory caselets:

    Final Balancei=Initial Capitali−Expenditurei+Inflowi\text{Final Balance}_i = \text{Initial Capital}_i - \text{Expenditure}_i + \text{Inflow}_i

    The aggregate conservation law guarantees:

    ∑i=1nInitiali−∑i=1nExpenditurei=∑i=1nFinali\sum_{i=1}^n \text{Initial}_i - \sum_{i=1}^n \text{Expenditure}_i = \sum_{i=1}^n \text{Final}_i


5. Diophantine Equations & Parity Filtering

Many caselets introduce subtle number-theoretic constraints:

  • Integer Constraints: Humans, items, and votes are non-negative integers (x∈N0x \in \mathbb{N}_0).

  • Parity Conservation:

    • odd×odd=odd\text{odd} \times \text{odd} = \text{odd}; if a product is odd, all factors must be odd.

    • even±even=even\text{even} \pm \text{even} = \text{even}, odd±odd=even\text{odd} \pm \text{odd} = \text{even}, odd±even=odd\text{odd} \pm \text{even} = \text{odd}.

  • Perfect Powers in Bounded Ranges (1≤x≤1001 \le x \le 100):

    • Cubes: {1,8,27,64}\{1, 8, 27, 64\}.

    • Squares: {1,4,9,16,25,36,49,64,81,100}\{1, 4, 9, 16, 25, 36, 49, 64, 81, 100\}.

    • Numbers that are both squares and cubes (6th powers): {1,64}\{1, 64\}.

    • Cubes that are not squares: {8,27}\{8, 27\}.


6. Multi-Period Tournament & Cohort Replacement Systems

In dynamic multi-period caselets (e.g., Year 1 through Year 5 tournaments):

  1. Round-Invariant Score Conservation: If ranks 1, 2, and 3 yield 5, 3, and 1 points respectively with 0 for ranks 4 and 5:

    Points awarded per period=5+3+1=9  ⟹  Total points across T periods=9×T\text{Points awarded per period} = 5 + 3 + 1 = 9 \implies \text{Total points across } T \text{ periods} = 9 \times T

  2. Cohort Lifecycle Tracking: For each entity, rigorously map its active window [tentry,texit][t_{\text{entry}}, t_{\text{exit}}]. Once an entity is substituted out and never returns, its score accumulation ceases immediately.

  3. Consecutive Period Constraint Filters: If an entity is restricted from scoring in consecutive periods, a participant active across TT periods can score at most ⌈T/2⌉\lceil T / 2 \rceil times, forcing scoring into alternating periods (e.g., Years 1, 3, 5).

Formulas

Principle of Inclusion-Exclusion (3-Set Canonical Disjoint Form)

∣A∪B∪C∣=I+II+III,∑∣A∣=I+2(II)+3(III),∑∣A∩B∣=II+3(III)|A \cup B \cup C| = I + II + III, \quad \sum |A| = I + 2(II) + 3(III), \quad \sum |A \cap B| = II + 3(III)

Expresses total union, sum of single set cardinalities, and pairwise intersections in terms of mutually exclusive components: Exactly One (I), Exactly Two (II), and All Three (III).
Generalized Multi-Set Intersection Lower Bound (Bonferroni Bound)

∣⋂i=1kAi∣≥∑i=1k∣Ai∣−(k−1)∣U∣|\bigcap_{i=1}^k A_i| \ge \sum_{i=1}^k |A_i| - (k - 1)|U|

Establishes the absolute mathematical minimum overlap across k sets within a finite universe U. For 3 sets, min(A \cap B \cap C) = max(0, |A| + |B| + |C| - 2|U|).
Venn Extremum Slack Transformation

II+2(III)=∑∣A∣−∣A∪B∪C∣,I−III=2∣A∪B∪C∣−∑∣A∣II + 2(III) = \sum |A| - |A \cup B \cup C|, \quad I - III = 2|A \cup B \cup C| - \sum |A|

The fundamental linear system governing maximization and minimization in 3-set Venn diagrams. Maximizing all-three (III) requires depressing exactly-two (II) to its minimal allowable integer slack.
Conservation of Ledger Balances in Flow Caselets

∑i=1nInitiali−∑i=1nOutflowi=∑i=1nFinali\sum_{i=1}^n \text{Initial}_i - \sum_{i=1}^n \text{Outflow}_i = \sum_{i=1}^n \text{Final}_i

The invariant conservation identity for transaction caselets. Individual differences Delta_i = Initial_i - Final_i match outbound expenditures, enabling system-wide permutation matching.

Traps and tips

  • Trap: The Intersection Inclusion ('A and B' vs 'Only A and B') Trap — In English phrasing, 'students who take Physics and Chemistry' denotes the entire overlap region n(P∩C)n(P \cap C), which includes students who ALSO take Mathematics (n(P∩C∩M)n(P \cap C \cap M)). In contrast, 'students who take Physics and Chemistry ONLY' excludes the three-subject overlap. Confusing n(A∩B)n(A \cap B) with n(A∩B∩Cc)n(A \cap B \cap C^c) is the single most common error in set-based caselets.
  • Trap: The Unstated Universe Complement Trap ('None / Neither') — When a caselet states that a cohort of 100 students participates in three sports, never assume that n(A∪B∪C)=100n(A \cup B \cup C) = 100 unless the text explicitly states 'each student plays at least one sport'. If non-participating elements exist, n(None)≥0n(\text{None}) \ge 0, and n(A∪B∪C)=∣U∣−n(None)≤100n(A \cup B \cup C) = |U| - n(\text{None}) \le 100.
  • Trap: Multi-Period Replacement Continuity Trap — When entities are replaced sequentially across rounds or years (e.g., Year 1 through Year 5), track the exact entry year and exit year of each participant. Assuming a participant who entered in Year 2 was present in Year 1, or that an exiting participant returned in later rounds without an explicit clue, completely invalidates point attribution tables.
  • Tip: The Parity & Diophantine Pruning Filter — In number-based logic caselets involving squares, cubes, and sums, immediately apply parity constraints (e.g., odd ×\times odd = odd) and size bounds. For instance, the only cubes under 100 are 1, 8, 27, 64; of these, only 1 and 64 are squares. Applying these filters instantly reduces hundreds of candidate combinations to 1 or 2 deterministic cases.
  • Tip: Tabular Matrix Reconstruction Protocol — Whenever a caselet describes entities distributed across multiple categories, do not attempt to solve the clues linearly in text. Immediately sketch an empty 2D matrix (Entities ×\times Attributes or Initial/Spent/Final). Enter definitive clues first, write algebraic relations for conditional clues, and use row/column sums as boundary checks.

Solved examples

Solved Example Set 1: Questions 1 to 4 (Cloud Infrastructure Cluster Audits)

Directions for Examples 1 to 4

A Senior Cloud Infrastructure Architect, Dr. Thorne, audits the operational health of ten distinct regional microservice clusters — labeled Cluster A through Cluster J. The number of worker nodes running in clusters A through J is 1 through 10 respectively (A=1,B=2,C=3,…,J=10A = 1, B = 2, C = 3, \dots, J = 10). No two clusters share any common worker nodes.

In a specific weekly audit cycle spanning six working days (Monday through Saturday, with system maintenance on Sunday):

  • Dr. Thorne completely omitted the worker nodes of exactly two out of the ten clusters (i.e., exactly two clusters were not audited on any day).

  • For each of the remaining eight clusters, he audited its worker nodes on exactly three different days.

  • On each of the six operational days (Monday through Saturday), he audited the worker nodes of exactly four distinct clusters.

  • The total number of worker nodes audited by him on Monday, Tuesday, Wednesday, Thursday, Friday, and Saturday was 18, 12, 23, 19, 32, and 25 respectively.

  • During the entire week, every worker node was fully active during its cluster's scheduled audit session.


Question 1

Worker nodes of which of the following clusters were NOT audited by Dr. Thorne in the given week?

(1) E and D

(2) G and D

(3) I and H

(4) D and H

Question 2

Worker nodes of which of the following clusters were NOT audited by him on Friday of the week?

(1) F

(2) I

(3) G

(4) None of these

Question 3

On Saturday of the week, if Dr. Thorne did not audit Cluster J but audited Cluster C, then worker nodes of which of the following clusters were NOT audited by him on any two consecutive days of the week?

(1) C

(2) E

(3) A

(4) G

Question 4

Under the conditions stated in Question 3, Cluster F was audited on:

(1) Tuesday, Friday and Saturday

(2) Tuesday, Thursday and Friday

(3) Tuesday, Wednesday and Saturday

(4) None of these

Show solution

Step-by-Step Solution & Mathematical Deductions

1. Baseline Conservation Equations

  • The number of worker nodes in clusters AA through JJ is:

    A=1,B=2,C=3,D=4,E=5,F=6,G=7,H=8,I=9,J=10A = 1, B = 2, C = 3, D = 4, E = 5, F = 6, G = 7, H = 8, I = 9, J = 10

    Total nodes across all 10 clusters=∑k=110k=10×112=55\text{Total nodes across all 10 clusters} = \sum_{k=1}^{10} k = \frac{10 \times 11}{2} = 55

  • If Dr. Thorne had audited all 10 clusters on exactly 3 days each, the total audited node-sessions would have been:

    Theoretical Total=55×3=165\text{Theoretical Total} = 55 \times 3 = 165

  • The actual total number of node-sessions audited across the six days is:

    Actual Total=18+12+23+19+32+25=129\text{Actual Total} = 18 + 12 + 23 + 19 + 32 + 25 = 129

  • Since each of the 8 audited clusters appeared on exactly 3 days, the sum of worker nodes in the 8 audited clusters must be:

    Sum of 8 audited clusters=1293=43\text{Sum of 8 audited clusters} = \frac{129}{3} = 43

  • Therefore, the sum of nodes in the two completely omitted clusters is:

    Sum of 2 omitted clusters=55−43=12\text{Sum of 2 omitted clusters} = 55 - 43 = 12

  • The candidate pairs from {1,2,…,10}\{1, 2, \dots, 10\} that sum to 12 are:

    (B,J)=(2,10),(C,I)=(3,9),(D,H)=(4,8),(E,G)=(5,7)(B, J) = (2, 10), \quad (C, I) = (3, 9), \quad (D, H) = (4, 8), \quad (E, G) = (5, 7)


2. Deduction of Omitted Clusters via Daily Extremes

Tuesday Audit (Total = 12 nodes across 4 clusters):

The 4 distinct clusters audited on Tuesday must sum to 12.

  • The minimum possible sum of 4 distinct clusters is 1+2+3+4=101 + 2 + 3 + 4 = 10.

  • The only partitions of 12 into 4 distinct integers from {1,…,10}\{1, \dots, 10\} are:

    • Case I: 1+2+3+6=12  ⟹  (A,B,C,F)1 + 2 + 3 + 6 = 12 \implies (A, B, C, F)

    • Case II: 1+2+4+5=12  ⟹  (A,B,D,E)1 + 2 + 4 + 5 = 12 \implies (A, B, D, E)

  • Notice that in both feasible cases, clusters AA and BB are mandatorily audited.

  • Since Cluster BB is audited during the week, the pair (B,J)(B, J) cannot be the omitted pair.

Friday Audit (Total = 32 nodes across 4 clusters):

The 4 distinct clusters audited on Friday must sum to 32.

  • The maximum possible sum of 4 distinct clusters is 7+8+9+10=347 + 8 + 9 + 10 = 34.

  • The partitions of 32 into 4 distinct integers ≤10\le 10 are:

    • Case III: 5+8+9+10=32  ⟹  (E,H,I,J)5 + 8 + 9 + 10 = 32 \implies (E, H, I, J)

    • Case IV: 6+7+9+10=32  ⟹  (F,G,I,J)6 + 7 + 9 + 10 = 32 \implies (F, G, I, J)

  • Notice that in both feasible cases:

    • Clusters II and JJ are mandatorily audited. Therefore, (C,I)(C, I) cannot be the omitted pair.

    • At least one of EE or GG must be audited on Friday. If (E,G)(E, G) were the omitted pair, neither EE nor GG could appear in any audit. Hence, (E,G)(E, G) cannot be the omitted pair.

Conclusion for Omitted Clusters:

By elimination of (B,J)(B, J), (C,I)(C, I), and (E,G)(E, G), the two clusters completely omitted by Dr. Thorne were D and H (44 and 88).


Question 1 Solution:

  • The omitted clusters were D and H.

  • Correct Answer: Option (4) — D and H.


Question 2 Solution:

  • Since Cluster HH was omitted from the entire week, Case III (E,H,I,J)(E, H, I, J) on Friday is impossible.

  • Therefore, Friday's audited clusters were uniquely F, G, I, and J.

  • Hence, all three of F,G,IF, G, I were audited on Friday.

  • Correct Answer: Option (4) — None of these.


Questions 3 & 4 Solution:

  • We are given: On Saturday, Dr. Thorne did not audit JJ (1010), but audited CC (33).

  • Saturday's total node count =25= 25 across 4 clusters.

  • The active clusters available are {A(1),B(2),C(3),E(5),F(6),G(7),I(9),J(10)}\{A(1), B(2), C(3), E(5), F(6), G(7), I(9), J(10)\}.

  • Excluding J(10)J(10) and including C(3)C(3), the other 3 clusters must sum to 25−3=2225 - 3 = 22.

  • The only 3 integers from {1,2,5,6,7,9}\{1, 2, 5, 6, 7, 9\} that sum to 22 are 6+7+9=22  ⟹  (F,G,I)6 + 7 + 9 = 22 \implies (F, G, I).

  • Thus, Saturday's audited clusters were uniquely C, F, G, and I.

Establishing the Complete Schedule:
  1. Tuesday: Since DD is omitted, Case II is impossible. Tuesday was uniquely A, B, C, and F.

  2. Frequency of Cluster F:

    • Cluster FF appeared on: Tuesday, Friday, and Saturday (33 days).

    • Since every audited cluster appears on exactly 3 days, FF cannot appear on Monday, Wednesday, or Thursday!

    • This directly answers Question 4: Cluster FF was audited on Tuesday, Friday, and Saturday.

  3. Frequency of Cluster E:

    • So far, EE has appeared on 0 days (not on Tue, Fri, or Sat).

    • Therefore, EE must be audited on all three remaining days: Monday, Wednesday, and Thursday.

  4. Thursday Audit (Total = 19):

    • Must include E(5)E(5), with the remaining 3 clusters summing to 19−5=1419 - 5 = 14.

    • Candidate triples without FF: (10,3,1)=(J,C,A)(10, 3, 1) = (J, C, A) or (9,3,2)=(I,C,B)(9, 3, 2) = (I, C, B).

    • In both cases, Cluster C is mandatorily audited on Thursday.

  5. Consecutive Days for Cluster C:

    • Cluster CC is audited on Tuesday, Thursday, and Saturday.

    • It is never audited on two consecutive days!

    • Meanwhile, Cluster EE is audited on Wednesday and Thursday (consecutive).

    • Cluster GG is audited on Friday and Saturday (consecutive).

    • Cluster AA is audited on Monday and Tuesday (consecutive).

    • Therefore, the cluster that was NOT audited on any two consecutive days is C.

Final Schedule Matrix:
DayTotal NodesClusters Audited
Monday18A, B, E, J
Tuesday12A, B, C, F
Wednesday23A, E, G, J or B, E, G, I
Thursday19B, C, E, I or A, C, E, J
Friday32F, G, I, J
Saturday25C, F, G, I
  • Question 3 Correct Answer: Option (1) — C.

  • Question 4 Correct Answer: Option (1) — Tuesday, Friday and Saturday.

Solved Example Set 2: Questions 5 to 7 (Cybersecurity Vulnerability Classification)

Directions for Examples 5 to 7

Four senior cybersecurity analysts — Aria, Brody, Clara, and Devin — audited four critical network vulnerability tokens (T1,T2,T3,T4T_1, T_2, T_3, T_4) in an automated threat intelligence system. For each token, four possible classification labels (a,b,c,da, b, c, d) were available.

In the assessment:

  • Each analyst classified all four vulnerability tokens.

  • Each analyst classified at least one token correctly.

  • No two analysts classified the same number of tokens correctly.

The table below shows the classification labels submitted by the four analysts:

AnalystToken 1Token 2Token 3Token 4
Ariaadba
Brodybcbb
Claraacdd
Devinacda

Question 5

Who classified exactly two vulnerability tokens correctly?

(1) Aria

(2) Brody

(3) Clara

(4) Devin

Question 6

What was the ground-truth classification label for the 4th vulnerability token (T4T_4)?

(1) a

(2) b

(3) c

(4) d

Question 7

If the bounty points assigned to T1,T2,T3,T4T_1, T_2, T_3, T_4 were 1, 2, 3, and 4 points respectively, and there was no penalty for incorrect classification, who scored the second-highest total bounty points?

(1) Aria

(2) Brody

(3) Clara

(4) Devin

Show solution

Step-by-Step Solution & Deductions

1. Integer Score Partition Principle

  • There are 4 analysts and 4 questions.

  • Each analyst answered at least 1 question correctly (Si≥1S_i \ge 1).

  • Maximum possible score is 4 (Si≤4S_i \le 4).

  • No two analysts had the same score.

  • Therefore, the multiset of correct answers among the 4 analysts must be a strict permutation of:

    {1,2,3,4}\{1, 2, 3, 4\}

    Exactly one analyst scored 4, one scored 3, one scored 2, and one scored 1.


2. Deduction of the Ground-Truth Answer Key

Let us test the hypothesis for the analyst who scored 4 (all 4 correct):

  • Hypothesis 1: Aria scored 4.

    • Key =(a,d,b,a)= (a, d, b, a).

    • Brody (b,c,b,b)(b, c, b, b): matches T3(b)  ⟹  1T_3(b) \implies 1 correct.

    • Clara (a,c,d,d)(a, c, d, d): matches T1(a)  ⟹  1T_1(a) \implies 1 correct.

    • Brody and Clara would both score 1, violating the distinct score rule. Hence, Aria did not score 4.

  • Hypothesis 2: Brody scored 4.

    • Key =(b,c,b,b)= (b, c, b, b).

    • Aria (a,d,b,a)(a, d, b, a): matches T3(b)  ⟹  1T_3(b) \implies 1 correct.

    • Clara (a,c,d,d)(a, c, d, d): matches T2(c)  ⟹  1T_2(c) \implies 1 correct.

    • Two analysts score 1. Violates the distinct score rule.

  • Hypothesis 3: Clara scored 4.

    • Key =(a,c,d,d)= (a, c, d, d).

    • Devin (a,c,d,a)(a, c, d, a): matches T1(a),T2(c),T3(d)  ⟹  3T_1(a), T_2(c), T_3(d) \implies 3 correct.

    • Aria (a,d,b,a)(a, d, b, a): matches T1(a)  ⟹  1T_1(a) \implies 1 correct.

    • Brody (b,c,b,b)(b, c, b, b): matches T2(c)  ⟹  1T_2(c) \implies 1 correct.

    • Both Aria and Brody score 1. Violates distinct scores.

  • Hypothesis 4: Devin scored 4.

    • Key =(a,c,d,a)= (a, c, d, a).

    • Let us evaluate all scores against this key:

      • Devin: (a,c,d,a)  ⟹  4 correct(a, c, d, a) \implies 4\text{ correct}

      • Clara: (a,c,d,d)  ⟹  (a, c, d, d) \implies matches T1(a),T2(c),T3(d)  ⟹  3 correctT_1(a), T_2(c), T_3(d) \implies 3\text{ correct}

      • Aria: (a,d,b,a)  ⟹  (a, d, b, a) \implies matches T1(a),T4(a)  ⟹  2 correctT_1(a), T_4(a) \implies 2\text{ correct}

      • Brody: (b,c,b,b)  ⟹  (b, c, b, b) \implies matches T2(c)  ⟹  1 correctT_2(c) \implies 1\text{ correct}

    • The scores obtained are {4,3,2,1}\{4, 3, 2, 1\}, which perfectly satisfies all constraints!

The unique ground-truth key is:

T1=a,T2=c,T3=d,T4=aT_1 = a, \quad T_2 = c, \quad T_3 = d, \quad T_4 = a


Question 5 Solution:

  • The analyst with exactly 2 correct classifications was Aria (T1T_1 and T4T_4).

  • Correct Answer: Option (1) — Aria.


Question 6 Solution:

  • The correct label for the 4th token (T4T_4) was a.

  • Correct Answer: Option (1) — a.


Question 7 Solution:

Weights assigned: T1=1T_1 = 1, T2=2T_2 = 2, T3=3T_3 = 3, T4=4T_4 = 4.

  • Devin: Correct on T1,T2,T3,T4  ⟹  1+2+3+4=10 pointsT_1, T_2, T_3, T_4 \implies 1 + 2 + 3 + 4 = 10\text{ points}.

  • Clara: Correct on T1,T2,T3  ⟹  1+2+3=6 pointsT_1, T_2, T_3 \implies 1 + 2 + 3 = 6\text{ points}.

  • Aria: Correct on T1,T4  ⟹  1+4=5 pointsT_1, T_4 \implies 1 + 4 = 5\text{ points}.

  • Brody: Correct on T2  ⟹  2 pointsT_2 \implies 2\text{ points}.

Ranking by points:

  1. Devin: 10 points

  2. Clara: 6 points (Second Highest)

  3. Aria: 5 points

  4. Brody: 2 points

  • Correct Answer: Option (3) — Clara.

Solved Example Set 3: Questions 8 to 11 (Venture Accelerator Startup Scoring)

Directions for Examples 8 to 11

Six early-stage enterprise SaaS startups — Juno, Solis, Helix, Beacon, Prism, and Echo — were evaluated in a venture accelerator demo day scoring index out of a maximum of 100 index points (1≤Score≤1001 \le \text{Score} \le 100). Each startup received a distinct integer score, and none scored zero.

It is also known that:

I. The score of each startup, except Beacon, was the square of a natural number.

II. The score of Juno was equal to the sum of the scores of two other startups in the cohort.

III. The scores of Beacon, Prism, and Echo were the cubes of natural numbers.

IV. The product of the scores of Juno and Prism was an odd natural number.

V. The absolute difference between the scores of Echo and Solis was equal to the score of one of the other startups in the cohort (excluding Echo and Solis).


Question 8

The index score of Juno was equal to the sum of the scores of:

(1) Beacon and Helix

(2) Solis and Echo

(3) Beacon and Prism

(4) Echo and Helix

Question 9

The ratio of the index scores of two startups in the cohort was 1:41 : 4. Which of the two scored the lower index score?

(1) Prism

(2) Juno

(3) Helix

(4) Echo

Question 10

Which startup scored the lowest index score in the cohort?

(1) Solis

(2) Beacon

(3) Helix

(4) Prism

Question 11

What was the sum of the index scores of Helix and Beacon?

(1) 37

(2) 72

(3) 65

(4) 44

Show solution

Step-by-Step Solution & Mathematical Deductions

Let the initial letters J,S,H,B,P,EJ, S, H, B, P, E denote the integer scores of Juno, Solis, Helix, Beacon, Prism, and Echo respectively.

1. Identify Candidate Square and Cube Domains in [1,100][1, 100]

  • Squares in 1..1001..100: {1,4,9,16,25,36,49,64,81,100}\{1, 4, 9, 16, 25, 36, 49, 64, 81, 100\}

  • Cubes in 1..1001..100: {13=1,23=8,33=27,43=64}\{1^3=1, 2^3=8, 3^3=27, 4^3=64\}

From Condition I, J,S,H,P,EJ, S, H, P, E are squares, while BB is not a square.

From Condition III, B,P,EB, P, E are cubes.

  • Since BB is a cube but not a square: B∈{8,27}B \in \{8, 27\}.

  • Since PP and EE are both cubes and squares, they must be 6th powers:

    {P,E}={1,64}\{P, E\} = \{1, 64\}


2. Deduce Prism, Echo, and Juno Parity

From Condition IV: J×PJ \times P is an odd natural number.

  • The product of two integers is odd if and only if both integers are odd.

  • Therefore, PP must be odd.

  • Since {P,E}={1,64}\{P, E\} = \{1, 64\} and 1 is odd while 64 is even:

    P=1,E=64P = 1, \quad E = 64

  • Since JJ is odd and a perfect square ≤100\le 100 with J≠P=1J \neq P = 1:

    J∈{9,25,49,81}J \in \{9, 25, 49, 81\}


3. Deduce Solis and Helix via Difference Constraint

From Condition V: ∣E−S∣=∣64−S∣|E - S| = |64 - S| equals the score of one of the other startups in {J,H,B,P}\{J, H, B, P\}.

  • SS must be a perfect square in {4,9,16,25,36,49,81,100}\{4, 9, 16, 25, 36, 49, 81, 100\} (excluding P=1,E=64P=1, E=64).

  • Let us test all possible values of SS and compute ∣64−S∣|64 - S|:

    • S=4  ⟹  ∣64−4∣=60S = 4 \implies |64 - 4| = 60 (neither square nor cube)

    • S=9  ⟹  ∣64−9∣=55S = 9 \implies |64 - 9| = 55

    • S=16  ⟹  ∣64−16∣=48S = 16 \implies |64 - 16| = 48

    • S=25  ⟹  ∣64−25∣=39S = 25 \implies |64 - 25| = 39

    • S=36  ⟹  ∣64−36∣=28S = 36 \implies |64 - 36| = 28

    • S=49  ⟹  ∣64−49∣=15S = 49 \implies |64 - 49| = 15

    • S=81  ⟹  ∣64−81∣=17S = 81 \implies |64 - 81| = 17

    • S=100  ⟹  ∣64−100∣=36=62S = 100 \implies |64 - 100| = 36 = 6^2 (a perfect square!)

  • Could ∣64−S∣|64 - S| equal BB (88 or 2727)?

    • 64−S=8  ⟹  S=5664 - S = 8 \implies S = 56 (not a square); S−64=8  ⟹  S=72S - 64 = 8 \implies S = 72 (not a square).

    • 64−S=27  ⟹  S=3764 - S = 27 \implies S = 37 (not a square); S−64=27  ⟹  S=91S - 64 = 27 \implies S = 91 (not a square).

  • Thus, the only feasible difference is 36, which implies:

    S=100,Difference=36S = 100, \quad \text{Difference} = 36

  • Since 36 is an even square, it cannot be P(1)P(1), B(8 or 27)B(8 \text{ or } 27), or JJ (odd).

  • Therefore, 36 must belong to Helix:

    H=36H = 36


4. Deduce Juno and Beacon via Additive Constraint

From Condition II: J=X+YJ = X + Y, where X,YX, Y are two other startups from {P(1),E(64),S(100),H(36),B(8 or 27)}\{P(1), E(64), S(100), H(36), B(8 \text{ or } 27)\}.

  • JJ must be an odd square from {9,25,49,81}\{9, 25, 49, 81\}.

  • Testing pairwise sums:

    • If B=8B = 8: B+P=8+1=9=32B + P = 8 + 1 = 9 = 3^2 (an odd square!).

    • If B=27B = 27: B+P=28B + P = 28 (not a square); B+H=63B + H = 63 (not a square).

    • No other pair of available scores sums to 25, 49, or 81.

  • Therefore, we uniquely obtain:

    J=9,B=8J = 9, \quad B = 8


Final Master Scoring Table:

StartupIndex ScoreMathematical Type
Prism (P)1$1^2 = 1^3$ (Odd 6th power)
Beacon (B)8$2^3$ (Cube, not a square)
Juno (J)9$3^2$ (Odd square; $8 + 1$)
Helix (H)36$6^2$ (Even square)
Echo (E)64$8^2 = 4^3$ (Even 6th power)
Solis (S)100$10^2$ (Even square)

Question 8 Solution:

  • J=B+P=8+1=9J = B + P = 8 + 1 = 9.

  • Correct Answer: Option (3) — Beacon and Prism.

Question 9 Solution:

  • Looking for pairs with ratio 1:41 : 4:

    JH=936=14\frac{J}{H} = \frac{9}{36} = \frac{1}{4}

  • The startup with the lower score in this pair is Juno (99).

  • Correct Answer: Option (2) — Juno.

Question 10 Solution:

  • The lowest score is 11, scored by Prism.

  • Correct Answer: Option (4) — Prism.

Question 11 Solution:

  • Sum=H+B=36+8=44\text{Sum} = H + B = 36 + 8 = 44.

  • Correct Answer: Option (4) — 44.

Solved Example Set 4: Questions 12 to 15 (Syndicate Venture Capital Deployment)

Directions for Examples 12 to 15

Five corporate venture capital funds — Fund A, Fund B, Fund C, Fund D, and Fund E — participated in a strategic startup acquisition round.

  • Before the deployment round, three of the five funds held distinct discretionary liquidity tranches from among 100M,100M, 300M, and 400M∗∗,whiletheremainingtwofundsheldtheidenticalliquiditytrancheof∗∗400M**, while the remaining two funds held the identical liquidity tranche of **200M.

  • During the round, no fund borrowed from or lent capital to any other fund.

  • After the round, each fund retained a distinct uninvested cash reserve from among 165M,165M, 95M, 70M,70M, 40M, and $10M, not necessarily in that order.

It is also known that:

I. Fund A started with more liquidity than Fund D started with.

II. Fund B deployed $15M more capital than Fund C deployed.

III. Fund E, which deployed $35M, started with more liquidity than exactly one fund in the cohort.

IV. Fund C started with 66.67% of the liquidity that Fund B started with.

V. Fund D was left with more uninvested cash than Fund A was left with.


Question 12

How much capital did Fund A deploy?

(1) $205M

(2) $190M

(3) $35M

(4) $360M

Question 13

What was the position of Fund E when the five funds were arranged in ascending order of capital deployed?

(1) 1st

(2) 2nd

(3) 4th

(4) 5th

Question 14

Which fund retained an uninvested cash reserve of $40M?

(1) Fund A

(2) Fund B

(3) Fund C

(4) Fund D

Question 15

What was the absolute difference between the capital amounts deployed by Fund B and Fund D?

(1) $160M

(2) $185M

(3) $180M

(4) None of these

Show solution

Step-by-Step Solution & Mathematical Deductions

1. Analyze Starting Liquidity Allocations

The multiset of initial liquidity tranches is:

\{100, 200, 200, 300, 400\}\text{ ($M)}

  • Condition IV: Fund C started with 66.67%=2366.67\% = \frac{2}{3} of what Fund B started with:

    CstartBstart=23\frac{C_{\text{start}}}{B_{\text{start}}} = \frac{2}{3}

    In the given set, the only pair in the ratio 2:32 : 3 is 200200 and 300300.

      ⟹  Cstart=200,Bstart=300\implies C_{\text{start}} = 200, \quad B_{\text{start}} = 300

  • Condition III: Fund E started with more liquidity than exactly one fund.

    • The starting amounts in ascending order are: 100100 (1 fund), 200200 (2 funds), 300300 (1 fund), 400400 (1 fund).

    • A fund holding 100100 has more than 0 funds.

    • A fund holding 200200 has more than exactly 1 fund (the fund holding 100100).

    • A fund holding 300300 has more than 3 funds (100,200,200100, 200, 200).

    • Therefore, Fund E must have started with $200M:

      Estart=200E_{\text{start}} = 200

    • Since Fund E deployed $35M\text{\textdollar}35\text{M}:

      Eend=200−35=165E_{\text{end}} = 200 - 35 = 165

  • Assigning A and D starting liquidity:

    • The remaining starting tranches are 100100 and 400400.

    • From Condition I, Astart>DstartA_{\text{start}} > D_{\text{start}}.

        ⟹  Astart=400,Dstart=100\implies A_{\text{start}} = 400, \quad D_{\text{start}} = 100


2. Deduce Ending Reserves and Deployments

The available uninvested ending cash reserves are:

{10,40,70,95,165}\{10, 40, 70, 95, 165\}

Since Eend=165E_{\text{end}} = 165, the remaining ending reserves for A, B, C, D are {10,40,70,95}\{10, 40, 70, 95\}.

  • Condition II: Bspent−Cspent=15B_{\text{spent}} - C_{\text{spent}} = 15.

    • By definition: Spent=Start−End\text{Spent} = \text{Start} - \text{End}.

    • (300−Bend)−(200−Cend)=15(300 - B_{\text{end}}) - (200 - C_{\text{end}}) = 15

    • 100−Bend+Cend=15  ⟹  Bend−Cend=85100 - B_{\text{end}} + C_{\text{end}} = 15 \implies B_{\text{end}} - C_{\text{end}} = 85.

    • From the remaining set {10,40,70,95}\{10, 40, 70, 95\}, the only pair with difference 85 is:

      95−10=85  ⟹  Bend=95,Cend=1095 - 10 = 85 \implies B_{\text{end}} = 95, \quad C_{\text{end}} = 10

    • Therefore:

      Bspent=300−95=205B_{\text{spent}} = 300 - 95 = 205

      Cspent=200−10=190C_{\text{spent}} = 200 - 10 = 190

      (Check: 205−190=15205 - 190 = 15, perfectly satisfied).

  • Assigning ending reserves for A and D:

    • The remaining ending reserves are {40,70}\{40, 70\}.

    • From Condition V, Dend>AendD_{\text{end}} > A_{\text{end}}.

        ⟹  Dend=70,Aend=40\implies D_{\text{end}} = 70, \quad A_{\text{end}} = 40

    • Therefore:

      Dspent=100−70=30D_{\text{spent}} = 100 - 70 = 30

      Aspent=400−40=360A_{\text{spent}} = 400 - 40 = 360


Final Master Balance Sheet Matrix:

FundStarting Liquidity ($M)Ending Uninvested Cash ($M)Capital Deployed ($M)
Fund A40040360
Fund B30095205
Fund C20010190
Fund D1007030
Fund E20016535

Question 12 Solution:

  • Fund A deployed $360M.

  • Correct Answer: Option (4) — $360M.

Question 13 Solution:

  • Ranking all funds in ascending order of capital deployed:

    1. Fund D: $30M

    2. Fund E: $35M (2nd Position)

    3. Fund C: $190M

    4. Fund B: $205M

    5. Fund A: $360M

  • Correct Answer: Option (2) — 2nd.

Question 14 Solution:

  • Fund A was left with $40M.

  • Correct Answer: Option (1) — Fund A.

Question 15 Solution:

  • |B_{\text{spent}} - D_{\text{spent}}| = |205 - 30| = 175\text{ (M)}$.

  • Since $175M is not among options (1), (2), or (3):

  • Correct Answer: Option (4) — None of these.

Solved Example Set 5: Questions 16 to 18 (Multi-Year AI Incubator Grant Tournament)

Directions for Examples 16 to 18

In each of five consecutive fiscal years — Year 1 through Year 5 — an elite tech incubator held an annual AI innovation competition featuring exactly five startup ventures each year.

  • At the conclusion of each annual competition, the five participating startups were awarded five distinct ranks: 1 through 5.

  • Performance grant points awarded were:

    • Rank 1: 5 points

    • Rank 2: 3 points

    • Rank 3: 1 point

    • Ranks 4 and 5: 0 points each.

  • A total of 9 different startup ventures participated over the span of the five years.

  • The table below shows the cumulative points garnered by each of the nine startups across the five years:

Startup VentureCumulative Points
Alpha5
Aether5
Nexus8
Umbra2
Solis5
Radiant6
Synapse4
Kinetix10
Pulse0

Participation & Substitution Rules:

  • In Year 1, Alpha, Aether, Nexus, Umbra, and Solis participated.

  • In Year 2, Radiant replaced Alpha.

  • In Year 3, Synapse replaced Aether.

  • In Year 4, Kinetix replaced Nexus.

  • In Year 5, Pulse replaced Umbra.

  • Once a startup was replaced by another, it did not participate in any subsequent year.

  • Constraint: Kinetix was the only participant that was awarded points in two consecutive years.


Question 16

If Solis was awarded Rank 3 in Year 3, which startup was awarded Rank 2 in Year 3?

(1) Nexus

(2) Radiant

(3) Synapse

(4) Either (1) or (2)

Question 17

At the end of the competition in Year 4, how many startups, out of those that had participated at least once by Year 4, had accumulated a total number of points strictly less than Radiant?

(1) 7

(2) 8

(3) 5

(4) 6

Question 18

In Year 5, what was the ratio of the number of points awarded to Synapse to that of Solis?

(1) 1 : 3

(2) 3 : 1

(3) 1 : 5

(4) Cannot be determined

Show solution

Step-by-Step Solution & Mathematical Deductions

1. Participant Active Windows

From the replacement schedule:

  • Alpha: Year 1 only (1 year)

  • Aether: Years 1, 2 (2 years)

  • Nexus: Years 1, 2, 3 (3 years)

  • Umbra: Years 1, 2, 3, 4 (4 years)

  • Solis: Years 1, 2, 3, 4, 5 (all 5 years)

  • Radiant: Years 2, 3, 4, 5 (4 years)

  • Synapse: Years 3, 4, 5 (3 years)

  • Kinetix: Years 4, 5 (2 years)

  • Pulse: Year 5 only (1 year)

Total points awarded in each year =5+3+1=9= 5 + 3 + 1 = 9 points. Across 5 years, total points =5×9=45= 5 \times 9 = 45, exactly matching the sum of table points (5+5+8+2+5+6+4+10+0=455 + 5 + 8 + 2 + 5 + 6 + 4 + 10 + 0 = 45).


2. Deduce Individual Rank Trajectories

  • Alpha (5 points): Participated only in Year 1. Must have won Rank 1 (5 pts) in Year 1.

  • Kinetix (10 points): Participated only in Years 4 and 5. Maximum possible points in 2 years is 5+5=105 + 5 = 10.

      ⟹  Rank 1 in Year 4, and Rank 1 in Year 5\implies \text{Rank 1 in Year 4, and Rank 1 in Year 5}

    (Notice: Kinetix scored in consecutive years 4 and 5. By the constraint, NO other startup may score in consecutive years).

  • Aether (5 points): Participated in Years 1 and 2. Since Alpha took Rank 1 in Year 1, Aether scored 0 in Year 1 and Rank 1 (5 pts) in Year 2.

  • Nexus (8 points): Participated in Years 1, 2, 3.

    • To get 8 points from {5,3,1}\{5, 3, 1\}, Nexus must have scored 5+3=85 + 3 = 8.

    • Nexus cannot score in consecutive years   ⟹  \implies Nexus scored in Year 1 and Year 3 (and 0 in Year 2).

    • In Year 1, Rank 1 was Alpha   ⟹  \implies Nexus took Rank 2 (3 pts) in Year 1.

    • In Year 3, Nexus took Rank 1 (5 pts).

  • Solis (5 points): Participated in all 5 years.

    • Rank 1 is occupied in all 5 years (Alpha, Aether, Nexus, Kinetix, Kinetix). Thus, Solis never won Rank 1.

    • To get 5 points without 5, Solis must score 3+1+1=53 + 1 + 1 = 5 across 3 years.

    • Solis cannot score in consecutive years. The only subset of 3 non-consecutive years in {1,2,3,4,5}\{1, 2, 3, 4, 5\} is Years 1, 3, and 5.

    • In Year 1, Rank 1 (Alpha) and Rank 2 (Nexus) are taken   ⟹  \implies Solis took Rank 3 (1 pt) in Year 1.

    • In Years 3 and 5, Solis must score 3 and 1 in some order.

  • Synapse (4 points): Participated in Years 3, 4, 5.

    • To get 4 points without scoring in consecutive years, Synapse must score in Years 3 and 5 (and 0 in Year 4).

    • Synapse must score 3+13 + 1 across Years 3 and 5.

  • Radiant (6 points): Participated in Years 2, 3, 4, 5.

    • In Years 3 and 5, all scoring ranks (1, 2, 3) are already occupied by Nexus/Kinetix, Solis, and Synapse!

    • Therefore, Radiant scored 0 points in Year 3 and Year 5.

    • Radiant must score its 6 points in Years 2 and 4: 3+3=63 + 3 = 6.

    •   ⟹  \implies Radiant took Rank 2 (3 pts) in Year 2, and Rank 2 (3 pts) in Year 4.

  • Umbra (2 points): Participated in Years 1, 2, 3, 4.

    • Scored 1+1=21 + 1 = 2.

    • In Year 1, Rank 3 went to Solis; in Year 3, scoring ranks are full.

    • Thus, Umbra scored in Years 2 and 4: Rank 3 (1 pt) in Year 2, and Rank 3 (1 pt) in Year 4.


Master Tournament Rank Matrix:

Fiscal YearRank 1 (5 pts)Rank 2 (3 pts)Rank 3 (1 pt)
Year 1AlphaNexusSolis
Year 2AetherRadiantUmbra
Year 3NexusSynapse or SolisSolis or Synapse
Year 4KinetixRadiantUmbra
Year 5KinetixSolis or SynapseSynapse or Solis

Question 16 Solution:

  • In Year 3, Ranks 2 and 3 are shared between Synapse and Solis.

  • If Solis was awarded Rank 3 in Year 3, then Synapse was awarded Rank 2.

  • Correct Answer: Option (3) — Synapse.

Question 17 Solution:

At the end of Year 4:

  • Radiant's total =3 (Yr 2)+3 (Yr 4)=6 points= 3\text{ (Yr 2)} + 3\text{ (Yr 4)} = 6\text{ points}.

  • Startups that had participated at least once by Year 4 (Pulse had not yet entered):

    • Alpha: 5<65 < 6

    • Aether: 5<65 < 6

    • Nexus: 3+5=8>63 + 5 = 8 > 6

    • Umbra: 1+1=2<61 + 1 = 2 < 6

    • Solis: 1 (Yr 1)+(1 or 3 in Yr 3)=2 or 4<61\text{ (Yr 1)} + (1 \text{ or } 3\text{ in Yr 3}) = 2 \text{ or } 4 < 6

    • Synapse: 1 or 3 in Yr 3<61 \text{ or } 3\text{ in Yr 3} < 6

    • Kinetix: 5 in Yr 4<65\text{ in Yr 4} < 6

  • Count of participants with total points strictly less than 6:

    Alpha, Aether, Umbra, Solis, Synapse, Kinetix  ⟹  6 startups\text{Alpha, Aether, Umbra, Solis, Synapse, Kinetix} \implies 6\text{ startups}

  • Correct Answer: Option (4) — 6.

Question 18 Solution:

  • In Year 5, Synapse and Solis receive ranks 2 and 3 in some order (33 points and 11 point).

  • The ratio of points awarded to Synapse vs. Solis could be 3:13 : 1 or 1:31 : 3.

  • Without additional clues, this cannot be uniquely determined.

  • Correct Answer: Option (4) — Cannot be determined.

Practice questions

Question 1 · Foundation

Diagnostic Assessment: Core Caselet Formulations

A senior engineering lead at an AI research institute surveyed a cohort of 120 software engineers regarding their primary production programming languages. The survey revealed that 75 engineers program in Python, 55 program in Rust, and 20 program in neither of these two languages.

How many software engineers in the cohort program in both Python and Rust?

  1. A

    30

  2. B

    35

  3. C

    25

  4. D

    40

Show answer and explanation

Answer: (A) 30

Step-by-Step Solution:

  1. Identify Given Set Values:

    • Universal set ∣U∣=120|U| = 120

    • Python programmers ∣P∣=75|P| = 75

    • Rust programmers ∣R∣=55|R| = 55

    • Neither language ∣(P∪R)c∣=20|(P \cup R)^c| = 20

  2. Compute the Union:

    ∣P∪R∣=∣U∣−∣(P∪R)c∣=120−20=100|P \cup R| = |U| - |(P \cup R)^c| = 120 - 20 = 100

  3. Apply the Principle of Inclusion-Exclusion for Two Sets:

    ∣P∪R∣=∣P∣+∣R∣−∣P∩R∣|P \cup R| = |P| + |R| - |P \cap R|

    100=75+55−∣P∩R∣100 = 75 + 55 - |P \cap R|

    100=130−∣P∩R∣  ⟹  ∣P∩R∣=130−100=30100 = 130 - |P \cap R| \implies |P \cap R| = 130 - 100 = 30

Thus, exactly 30 engineers program in both Python and Rust.

Question 2 · Foundation

Diagnostic Assessment: Core Caselet Formulations

A venture capital firm surveyed 200 portfolio tech executives regarding their active enterprise SaaS stack: Customer Relationship Management (CRM), Enterprise Resource Planning (ERP), and Business Intelligence (BI) platforms.

The audit revealed the following metrics:

  • 110 executives use CRM, 95 use ERP, and 80 use BI.

  • 45 executives use both CRM and ERP.

  • 35 executives use both ERP and BI.

  • 40 executives use both CRM and BI.

  • 20 executives use all three platforms.

How many executives use exactly two of these three enterprise platforms?

  1. A

    60

  2. B

    80

  3. C

    120

  4. D

    40

Show answer and explanation

Answer: (A) 60

Step-by-Step Solution:

  1. Understand Canonical Overlaps:

    Each stated pairwise overlap ∣A∩B∣|A \cap B| includes executives who use all three platforms (∣A∩B∩C∣|A \cap B \cap C|).

    • Executives using CRM and ERP only =∣(CRM∩ERP)∖BI∣=45−20=25= |(\text{CRM} \cap \text{ERP}) \setminus \text{BI}| = 45 - 20 = 25

    • Executives using ERP and BI only =∣(ERP∩BI)∖CRM∣=35−20=15= |(\text{ERP} \cap \text{BI}) \setminus \text{CRM}| = 35 - 20 = 15

    • Executives using CRM and BI only =∣(CRM∩BI)∖ERP∣=40−20=20= |(\text{CRM} \cap \text{BI}) \setminus \text{ERP}| = 40 - 20 = 20

  2. Calculate 'Exactly Two Platforms':

    Exactly Two=25+15+20=60\text{Exactly Two} = 25 + 15 + 20 = 60

(Alternatively, use the master formula: Exactly Two=∑∣A∩B∣−3∣A∩B∩C∣=(45+35+40)−3(20)=120−60=60\text{Exactly Two} = \sum |A \cap B| - 3|A \cap B \cap C| = (45 + 35 + 40) - 3(20) = 120 - 60 = 60.)

Thus, exactly 60 executives use exactly two platforms.

Question 3 · Foundation

Diagnostic Assessment: Core Caselet Formulations

In an executive board of 100 corporate directors voting on three key governance resolutions (R1,R2,R3R_1, R_2, R_3):

  • 85 directors voted in favor of Resolution R1R_1.

  • 75 directors voted in favor of Resolution R2R_2.

  • 80 directors voted in favor of Resolution R3R_3.

Every director was present and cast a vote on all three resolutions.

What is the minimum possible number of directors who voted in favor of all three resolutions?

  1. A

    40

  2. B

    20

  3. C

    50

  4. D

    30

Show answer and explanation

Answer: (A) 40

Step-by-Step Solution:

  1. Apply the Bonferroni / Fréchet Intersection Lower Bound:

    For kk sets in a finite universe UU:

    ∣⋂i=1kAi∣≥∑i=1k∣Ai∣−(k−1)∣U∣|\bigcap_{i=1}^k A_i| \ge \sum_{i=1}^k |A_i| - (k - 1)|U|

  2. Substitute Given Parameters (k=3,∣U∣=100k = 3, |U| = 100):

    min⁡(∣R1∩R2∩R3∣)=85+75+80−2(100)\min(|R_1 \cap R_2 \cap R_3|) = 85 + 75 + 80 - 2(100)

    min⁡(∣R1∩R2∩R3∣)=240−200=40\min(|R_1 \cap R_2 \cap R_3|) = 240 - 200 = 40

  3. Complementary Logic Verification:

    • Directors voting against R1=100−85=15R_1 = 100 - 85 = 15

    • Directors voting against R2=100−75=25R_2 = 100 - 75 = 25

    • Directors voting against R3=100−80=20R_3 = 100 - 80 = 20

    • In the worst-case scenario where no director votes against more than one resolution, the total distinct directors voting against at least one resolution is at most:

      15+25+20=6015 + 25 + 20 = 60

    • Therefore, at least 100−60=40100 - 60 = 40 directors must have voted in favor of all three.

Thus, the minimum possible number of directors voting in favor of all three resolutions is 40.

Question 4 · Foundation

Diagnostic Assessment: Core Caselet Formulations

A boutique management consultancy evaluated three analysts — Liam, Maya, and Noah — across three fiscal quarters (Q1,Q2,Q3Q_1, Q_2, Q_3). The table below tracks billable client hours logged, but several entries were corrupted in the reporting database:

AnalystQ1 HoursQ2 HoursQ3 HoursTotal Hours
Liam40—50145
Maya—6045135
Noah3545——
Total—160—400

What was the total number of billable client hours logged by Noah in Q3?

  1. A

    40

  2. B

    35

  3. C

    45

  4. D

    50

Show answer and explanation

Answer: (A) 40

Step-by-Step Solution:

  1. Reconstruct Liam's Missing Q2 Hours:

    Liam Total=40+Q2,L+50=145  ⟹  Q2,L=145−90=55 hours\text{Liam Total} = 40 + Q_{2, L} + 50 = 145 \implies Q_{2, L} = 145 - 90 = 55\text{ hours}

  2. Reconstruct Maya's Missing Q1 Hours:

    Maya Total=Q1,M+60+45=135  ⟹  Q1,M=135−105=30 hours\text{Maya Total} = Q_{1, M} + 60 + 45 = 135 \implies Q_{1, M} = 135 - 105 = 30\text{ hours}

  3. Verify Column Q2 Consistency:

    Liam(55)+Maya(60)+Noah(45)=160 hours (Consistent!)\text{Liam}(55) + \text{Maya}(60) + \text{Noah}(45) = 160\text{ hours (Consistent!)}

  4. Reconstruct Noah's Total Hours:

    Grand Total=Liam(145)+Maya(135)+Noah(Total)=400\text{Grand Total} = \text{Liam}(145) + \text{Maya}(135) + \text{Noah}(\text{Total}) = 400

    Noah Total=400−(145+135)=400−280=120 hours\text{Noah Total} = 400 - (145 + 135) = 400 - 280 = 120\text{ hours}

  5. Solve for Noah's Q3 Hours:

    Noah Total=35+45+Q3,N=120\text{Noah Total} = 35 + 45 + Q_{3, N} = 120

    80+Q3,N=120  ⟹  Q3,N=120−80=40 hours80 + Q_{3, N} = 120 \implies Q_{3, N} = 120 - 80 = 40\text{ hours}

Thus, Noah logged 40 billable hours in Q3.

Question 5 · Foundation

Diagnostic Assessment: Core Caselet Formulations

In a fintech startup consisting of 160 employees, every employee works in exactly one of three departments: Product, Engineering, or Design.

  • Exactly 40 employees work in Design.

  • The ratio of employees in Product to Engineering is 1:21 : 2.

  • Exactly 40% of Product employees are female, and 50% of Design employees are female.

  • Across the entire startup, exactly 60 employees are female.

What percentage of employees in the Engineering department are male?

  1. A

    70%

  2. B

    65%

  3. C

    60%

  4. D

    75%

Show answer and explanation

Answer: (A) 70%

Step-by-Step Solution:

  1. Determine Department Headcounts:

    Total Employees=160,Design=40\text{Total Employees} = 160, \quad \text{Design} = 40

    Product+Engineering=160−40=120\text{Product} + \text{Engineering} = 160 - 40 = 120

    Given ratio Product:Engineering=1:2\text{Product} : \text{Engineering} = 1 : 2:

    Product=120×13=40\text{Product} = 120 \times \frac{1}{3} = 40

    Engineering=120×23=80\text{Engineering} = 120 \times \frac{2}{3} = 80

  2. Determine Female Employee Counts:

    • Product Females =40% of 40=16= 40\% \text{ of } 40 = 16

    • Design Females =50% of 40=20= 50\% \text{ of } 40 = 20

    • Total Females in Product and Design =16+20=36= 16 + 20 = 36

    • Given total female employees =60= 60:

      Engineering Females=60−36=24\text{Engineering Females} = 60 - 36 = 24

  3. Determine Male Count in Engineering:

    Engineering Males=80−24=56\text{Engineering Males} = 80 - 24 = 56

  4. Calculate Percentage of Males in Engineering:

    Percentage=5680×100%=710×100%=70%\text{Percentage} = \frac{56}{80} \times 100\% = \frac{7}{10} \times 100\% = 70\%

Thus, 70% of employees in the Engineering department are male.

Study this concept with interactive practice in PrepSoc.

Open the concept library