📚 Study Notes – Caselets
Quantitative Aptitude (Nagaland PSC)
MIT‑level, first‑principles treatment
What is a “Caselet”?
A caselet is a short, self‑contained problem that demands a case‑by‑case analysis.
Unlike a typical word problem, a caselet usually hides multiple layers of constraints that can be uncovered only by enumerating the distinct “cases” that satisfy the given conditions.
1. Core Concepts
| Concept | Definition | Why it matters in a Caselet |
|---|---|---|
| Variables | Quantities to be found (e.g. x, y, n) |
Provide the system of equations/inequalities to be solved. |
| Constraints | Conditions that variables must satisfy (e.g. x + y = 10, x is even) |
Define the feasible space we must explore. |
| Cases | Distinct partitions of the feasible space based on key properties (e.g. x even/odd, y > 5) |
Reduce a complex system to simpler sub‑problems. |
| Case‑by‑Case Analysis | Solve each case separately; then combine the results (sum, union, etc.) | Prevents double‑counting and captures all possibilities. |
2. Systematic Approach
Step‑by‑Step Blueprint
| Step | Action | Typical Pitfall | Quick Fix |
|---|---|---|---|
| 1 | Parse the statement | Missed constraints or hidden assumptions | Re‑read twice; highlight each condition. |
| 2 | List variables & constraints | Omit a variable → incomplete solution | Write a table: *Variable |
| 3 | Choose a key property | Over‑complicated case splits | Pick the most restrictive property first. |
| 4 | Enumerate cases | Duplicate or missing cases | Use a decision tree or Venn diagram. |
| 5 | Solve each sub‑problem | Algebraic errors | Keep a clean workspace; double‑check each equation. |
| 6 | Combine results | Over/under‑counting | Verify with inclusion‑exclusion if cases overlap. |
| 7 | Cross‑check | Mis‑interpreted “at least” vs “exactly” | Test edge values. |
3. Advanced Theory
3.1 Counting Principles
| Principle | Formula | Example |
|---|---|---|
| Multiplication Rule | If a step can be performed in m ways and the next in n ways, the total ways = m·n. |
Arranging 3 men & 2 women in a line = 3!·2! = 12. |
| Addition Rule | If two disjoint events A and B can occur, total = ` |
A |
3.2 Inclusion‑Exclusion
For sets (A_1, A_2, \dots, A_k):
[ |A_1\cup A_2\cup\cdots\cup A_k| = \sum_{i} |A_i|
- \sum_{i<j} |A_i\cap A_j|
- \sum_{i<j<l} |A_i\cap A_j\cap A_l|
- \cdots ]
Use case: Avoid double‑counting when cases overlap.
3.3 Conditional Probability
If (P(A|B)) is the probability of (A) given (B):
[ P(A|B) = \frac{P(A\cap B)}{P(B)} ]
Application: After fixing a case, compute probability of an additional constraint.
3.4 Generating Functions (for combinatorial counts)
For a set of integers (S = {s_1,s_2,\dots}), the generating function is:
[ G(x) = \prod_{i} (1 + x^{s_i} + x^{2s_i} + \cdots) ]
Coefficient of (x^n) gives the number of ways to sum to n using elements from S.
Example: Count ways to make 10 using 1, 2, and 3:
(G(x)=\frac{1}{(1-x)(1-x^2)(1-x^3)}). Extract coefficient of (x^{10}).
3.5 Recurrence Relations
Often a caselet leads to a recurrence:
[ a_n = p,a_{n-1} + q,a_{n-2