Notes › Aptitude
Number System, Permutations and Probability Shortcuts
Number system
Types of numbers
Natural (1, 2, 3…), whole (0, 1, 2…), integers, rational (p/q), irrational (√2, π). Primes have exactly two factors; 1 is neither prime nor composite; 2 is the only even prime. There are 25 primes below 100.
Divisibility rules
| By | Rule |
|---|---|
| 2 | last digit even |
| 3 | sum of digits divisible by 3 |
| 4 | last two digits divisible by 4 |
| 5 | last digit 0 or 5 |
| 6 | divisible by 2 and 3 |
| 8 | last three digits divisible by 8 |
| 9 | sum of digits divisible by 9 |
| 11 | (sum of odd-position digits) − (sum of even-position digits) = 0 or a multiple of 11 |
| 7, 13 | take groups of three digits from the right with alternating signs (+ − +); divisible if the result is |
| Example (11): 2728 → (2 + 2) − (7 + 8) = −11 → divisible ✔. |
HCF and LCM
- HCF × LCM = product of the two numbers (only for two numbers).
- HCF of fractions = HCF(numerators) / LCM(denominators); LCM of fractions = LCM(numerators) / HCF(denominators).
- "Largest number that divides 43, 91 and 183 leaving the same remainder" = HCF of the differences: HCF(48, 92, 140) = 4.
- "Smallest number that leaves remainder r when divided by a, b, c" = LCM(a, b, c) + r.
Number of factors
Write N = pᵃ × qᵇ × rᶜ → number of factors = (a + 1)(b + 1)(c + 1).
- 360 = 2³ × 3² × 5 → 4 × 3 × 2 = 24 factors.
- Sum of factors = (p⁰ + … + pᵃ)(q⁰ + … + qᵇ)…
Unit digit (cyclicity)
| Digit | Cycle of last digits | Length |
|---|---|---|
| 0, 1, 5, 6 | always itself | 1 |
| 4 | 4, 6 | 2 |
| 9 | 9, 1 | 2 |
| 2 | 2, 4, 8, 6 | 4 |
| 3 | 3, 9, 7, 1 | 4 |
| 7 | 7, 9, 3, 1 | 4 |
| 8 | 8, 4, 2, 6 | 4 |
| Unit digit of 7⁴³: 43 mod 4 = 3 → third in the cycle → 3. (If the remainder is 0, take the 4th.) |
Trailing zeros of n!
Count factors of 5: ⌊n/5⌋ + ⌊n/25⌋ + ⌊n/125⌋ + … 100! → 20 + 4 = 24 zeros.
Remainders
- (a × b) mod n = ((a mod n) × (b mod n)) mod n — reduce first.
- Remainder of 2¹⁰⁰ ÷ 7: 2³ = 8 ≡ 1 (mod 7), so 2⁹⁹ ≡ 1 and 2¹⁰⁰ ≡ 2.
Useful sums
- 1 + 2 + … + n = n(n + 1)/2
- 1² + … + n² = n(n + 1)(2n + 1)/6
- 1³ + … + n³ = [n(n + 1)/2]²
- AP: nth term a + (n − 1)d, sum n/2 × (2a + (n − 1)d); GP: nth term arⁿ⁻¹, sum a(rⁿ − 1)/(r − 1).
Practice: Number System
Permutations and combinations
- Permutation = arrangement (order matters): ⁿPᵣ = n! / (n − r)!
- Combination = selection (order doesn't matter): ⁿCᵣ = n! / (r! (n − r)!), and ⁿCᵣ = ⁿCₙ₋ᵣ.
- Ask: "Does swapping two chosen items give a new outcome?" Yes → permutation; no → combination.
| Situation | Formula | Example |
|---|---|---|
| Arrange n distinct items | n! | 5 books → 120 |
| Arrange with repeats | n! / (p! q! …) | LEVEL (L×2, E×2) → 5!/(2!·2!) = 30 |
| Around a circle | (n − 1)! | 6 people → 120 |
| Necklace / garland (can flip) | (n − 1)! / 2 | 6 beads → 60 |
| Items always together | treat as one block × internal arrangements | 2 friends together among 5 → 4! × 2! = 48 |
| Never together | total − together | 5! − 48 = 72 |
| At least one | total − none | below |
Committee of 3 from 5 men and 4 women with at least one woman: ⁹C₃ − ⁵C₃ = 84 − 10 = 74.
Handshakes among n people: ⁿC₂ (10 people → 45). Diagonals of an n-gon: ⁿC₂ − n (hexagon → 9).
Words from INDIA: 5 letters, I twice → 5!/2! = 60.
Practice: Permutation & Combination
Probability
P(E) = favourable outcomes / total outcomes, between 0 and 1. P(not E) = 1 − P(E).
- Addition: P(A or B) = P(A) + P(B) − P(A and B).
- Independent events: P(A and B) = P(A) × P(B).
- Conditional: P(A | B) = P(A and B) / P(B).
| Experiment | Total outcomes |
|---|---|
| 1 coin / n coins | 2 / 2ⁿ |
| 1 die / 2 dice | 6 / 36 |
| Deck of cards | 52 = 4 suits × 13; 26 red, 26 black; 12 face cards (J, Q, K); 4 aces |
Solved
- Two dice, sum 7: (1,6) (2,5) (3,4) (4,3) (5,2) (6,1) → 6/36 = 1/6.
- At least one head in 3 tosses: 1 − P(no heads) = 1 − 1/8 = 7/8.
- A king or a heart: 4/52 + 13/52 − 1/52 = 16/52 = 4/13.
- Bag with 3 red and 5 blue; two drawn without replacement, both red: 3/8 × 2/7 = 3/28.
Practice: Probability
Clocks
- The minute hand moves 6° per minute; the hour hand 0.5° per minute. Relative speed 5.5° per minute.
- Angle between hands at H:M = |30H − 5.5M| (if > 180°, subtract from 360°).
- 3:40 → |90 − 220| = 130°.
- Hands overlap 11 times in 12 hours (22 in a day), every 65 5/11 minutes; they are at a right angle 44 times a day; opposite (180°) 22 times a day.
Calendars
- Odd days = days left over after full weeks. Normal year = 365 days = 52 weeks + 1 odd day; leap year = 2 odd days.
- Leap year: divisible by 4, but century years must be divisible by 400 (2000 ✔, 1900 ✘).
- If today is Monday, the day after 61 days: 61 mod 7 = 5 → Monday + 5 = Saturday.
- A calendar repeats after 6 or 11 years for normal years (depending on leap years in between), and 28 years for a leap year.
Practice: Clock & Calendar
Exam tips
- Factorise and cancel before multiplying big numbers.
- For "at least one", always use 1 − none.
- Check whether repetition is allowed and whether order matters before choosing a formula.
More: Quantitative Aptitude Formula Sheet — Arithmetic · Logical Reasoning Tricks.