SSC Stenographer – Quantitative Aptitude
Caselets – Advanced University‑Level Study Notes
Target Audience – Senior secondary students preparing for the SSC Stenographer exam.
Goal – Master the “caselet” section: short, tightly‑framed problems that demand quick, precise reasoning.
Approach – Start from first principles, build rigorous reasoning, explore deeper theory, cover edge cases, and finish with a challenging problem.
1. What Are “Caselets”?
| Feature | Explanation |
|---|---|
| Length | 1–4 sentences, 1–2 numbers |
| Type | Pure arithmetic, simple algebra, or combinatorial logic |
| Time | 30–60 seconds per caselet (in the exam, 10–15 caselets per paper) |
| Goal | Identify pattern → compute answer in one step |
| Typical Problems | “If 2 × 3 = 6, 3 × 4 = 12, …, what is 9 × 10?” or “A number is divisible by 3 if …” |
The key is pattern recognition. Unlike longer questions, caselets rarely allow multi‑step algebraic manipulations; they test mental agility and familiarity with common “tricks”.
2. First Principles – The Building Blocks
| Principle | Why It Matters in Caselets | Example |
|---|---|---|
| Counting Basics | Many caselets reduce to “how many ways” or “how many numbers satisfy …” | “In how many ways can 3 letters be chosen from ABCDE?” |
| Number Theory | Divisibility, modular arithmetic, primes | “Is 12345 divisible by 5?” |
| Algebraic Patterns | Recognizing sequences, arithmetic/geometric progressions | “If 1+2+3=6, 2+4+6=12, … what is 10+20+30?” |
| Symmetry & Parity | Even/odd behavior, mirror images | “How many 2‑digit numbers are palindromes?” |
| Base‑10 Properties | Units digit, last digit patterns | “What is the last digit of 7^2023?” |
Tip: Keep a mental checklist: Is this a counting problem? Is there a divisibility rule? Is there a pattern in the first digit?
3. Advanced Theory – Beyond Basics
| Advanced Tool | When to Use | Core Idea |
|---|---|---|
| Inclusion–Exclusion | Counting objects that satisfy at least one of several conditions | Subtract over‑counts, add back overlaps |
| Generating Functions | Counting partitions or arranging objects with restrictions | Encode possibilities as power series |
| Modular Arithmetic (Mod n) | Determining last digit, cyclicity | Reduce huge exponents by computing modulo φ(n) |
| Combinatorial Identities | Simplify factorial expressions | ( \binom{n}{k} = \frac{n!}{k!(n-k)!} ) |
| Recurrence Relations | Sequences defined by previous terms | (a_n = a_{n-1} + a_{n-2}) (Fibonacci) |
| Parity Arguments | Proving impossibility of certain sums | If sum of two even numbers is even, etc. |
Why include these?
Even if the exam rarely expects you to derive them from scratch, knowing when a caselet hinges on, say, inclusion–exclusion, saves time: you can immediately apply the formula instead of trying to list all cases.
4. Edge Cases – What Triggers Traps?
| Edge Case | Common Trap | How to Spot |
|---|---|---|
| Zero or Negative Numbers | Forgetting that 0×anything = 0 or that “−3×−4 = 12” | Look for sign changes in the description |
| Fractions / Decimals | Misapplying integer rules | Check if the problem explicitly mentions fractions |
| Large Numbers | Overflow in mental arithmetic | Use modular shortcuts or break into parts |
| Ambiguous Language | “Greater than” vs “greater than or equal to” | Carefully note any inequality signs |
| Units Digit vs Full Number | “What is the last digit?” | Separate from “What is the whole number?” |
| Multiple Valid Answers | “Find the smallest” vs “Find the largest” | Pay attention to qualifiers |
Rule of thumb: If the problem statement involves “at least” or “at most,” think inclusion–exclusion or bounds counting.
5. Quick‑Trick Toolbox
| Trick | Description | Example |
|---|---|---|
| Digit Sum for Divisibility by 3 | Sum of digits dictates divisibility | 12345 → 1+2+3+4+5 = 15 → divisible |
| Alternating Sum for 11 | (Sum of odd‑place digits) – (Sum of even‑place digits) → divisible by 11 | 1211: |