Number Sets and the Box Picture
- Natural: 1, 2, 3, … (no 0)
- Whole: 0, 1, 2, 3, …
- Integers: whole numbers and their negatives
- Rational: with , including terminating and recurring decimals
- Irrational: never ends and never repeats, like and
- Real: rational and irrational together
Traps: 0 is whole but not natural. "Integer but not whole" means negative. is rational. 22/7 is rational, is not. No number is both rational and irrational.
Rational and Irrational Operations
- Rational ± rational, rational × rational: always rational
- Rational ± irrational: always irrational
- Non-zero rational × irrational: always irrational
- Irrational ± irrational, irrational × irrational: can be either
- is irrational unless is a perfect square
Examples: is rational, is irrational, and is rational.
[SSC Tip] Simplify before you decide. is always rational when and are rational. The rule says non-zero because .
Terminating and Recurring Decimals
- Reduce the fraction to lowest terms first.
- It terminates if the denominator has only 2s and 5s, and recurs otherwise. 21/56 = 3/8 terminates even though 56 has a 7.
- For , decimal places = the larger of and .
Converting:
- Pure: , one 9 per repeating digit
- Mixed: , a 9 per repeating digit, then a 0 per non-repeating digit
Add recurring decimals as fractions, never digit by digit.
Primes, Co-primes and Digit Facts
- 1 is neither prime nor composite. 2 is the only even prime.
- There are 25 primes up to 100 (15 up to 50).
- To test , divide by the primes up to .
- Co-prime means HCF 1. Consecutive numbers are always co-prime, and 8 and 15 are co-prime though neither is prime.
- Lookalikes that are not prime: 91, 119, 133, 143, 161, 187, 203, 209, 221.
- Place value = digit × value of its place. Face value = the digit.
- Number − reverse = . Number + reverse = .
Divisibility Rules
| Divisor | Test |
|---|---|
| 2 | last digit even |
| 3 | digit sum divisible by 3 |
| 4 | last two digits divisible by 4 |
| 5 | last digit 0 or 5 |
| 8 | last three digits divisible by 8 |
| 9 | digit sum divisible by 9 |
| 10 | last digit 0 |
| 11 | alternate-digit sums differ by 0 or a multiple of 11 |
| 7, 11, 13 | split into 3-digit blocks from the right; the alternate-block difference is divisible by it |
1001 = 7 × 11 × 13, so any six-digit number like abcabc is divisible by all three.
Composite Divisors and Missing Digits
- Split into co-prime factors: 24 = 3 × 8, 36 = 4 × 9, 72 = 8 × 9, 88 = 8 × 11, 99 = 9 × 11. Never 4 × 6 for 24 (they share a 2).
- Missing digits: use the last-digits rule (5, 4, 8) first, then the digit-sum or 11-test.
- For 99, add digit pairs from the right; the total must be a multiple of 99.
- Least to subtract = remainder. Least to add = divisor − remainder.
- Largest n-digit multiple = largest n-digit number − remainder.
Counting and Summing Multiples
- Multiples of from 1 to : the whole-number part of .
- Divisible by and together: count multiples of their LCM.
- Divisible by but not : multiples of minus multiples of LCM(, ).
- . The first odd numbers add to .
- Sum of multiples in a range = count × (first + last) ÷ 2.
- is divisible by always, and by when is even.
- is divisible by when is odd.
Factor Formulas
For :
- Number of factors =
- Odd factors: leave out the 2s and use the same formula on the rest
- Even factors = total − odd
- Square factors: count only even powers. gives 0, 2, 4, which is 3 choices
- [Tier 2] Sum of factors =
Example: 540 = has 24 factors, 8 odd and 16 even. A perfect square is the only kind of number with an odd number of factors.
Trailing Zeros and Highest Power
- Zeros at the end of : add , , , … and ignore every remainder. ends in 20 + 4 = 24 zeros.
- Highest power of a prime in : same method with , , , …
- [Tier 2] For a composite like , find the powers of 2 and of 3 separately, halve the count of 2s, and take the smaller answer.
- Zeros at the end of a product: count the 2s and 5s; zeros = the smaller count.
Perfect Squares
- A square ends in 0, 1, 4, 5, 6 or 9, never in 2, 3, 7 or 8.
- Zeros at the end come in pairs: 1600 can be a square, 16000 can't.
- Every prime in its factorisation has an even power.
- Smallest multiplier or divisor: the product of the primes with odd powers.
- Least to add or subtract: find the squares just above and just below.
- Squares between A and B: count the numbers whose squares lie in the range.
- Least square divisible by given numbers: take the LCM, then make every power even.
Remainders and Changing the Divisor
- Dividend = divisor × quotient + remainder, with remainder smaller than divisor.
- Sums and products: work with the remainders, then reduce again.
- Changing the divisor: if N leaves r with D and d divides D, then N leaves the remainder of r ÷ d. Otherwise the answer is not fixed.
- Negative remainders save time: 17 leaves −1 with 18. Add the divisor back at the end.
- Same remainder r with every divisor: N = LCM × k + r.
- Same gap c = divisor − remainder: N = LCM × k − c.
Large Powers and Unit Digit Cycles
- For a big power, find a small power that leaves 1 or −1: leaves 1 with 5 and −1 with 17.
- leaves 1 with D when is even, and D − 1 when is odd.
- [Tier 2] For a prime not dividing , leaves 1 with .
- Unit digits: 0, 1, 5, 6 never change. 4 and 9 repeat every 2 powers. 2, 3, 7, 8 repeat every 4: 2-4-8-6, 3-9-7-1, 7-9-3-1, 8-4-2-6.
- Divide the power by 4; remainder 0 means the 4th digit.
HCF and LCM Rules
- HCF: common primes, lowest powers. LCM: all primes, highest powers.
- HCF × LCM = product, for two numbers only.
- HCF always divides LCM. Co-prime: HCF 1, LCM = product.
- Ratio (co-prime) with HCF : numbers and , LCM .
- Fractions: HCF = HCF of numerators ÷ LCM of denominators. LCM = LCM of numerators ÷ HCF of denominators.
- Decimals: equalise the decimal places, work with whole numbers, then put the point back.
- Pairs with HCF and product P: count co-prime pairs with product .
HCF and LCM Word-Problem Signals
HCF words: greatest, largest, maximum, equal pieces, largest tile, longest rope, biggest container, most students to share equally.
LCM words: least, smallest, ring or flash together again, meet at the start, least number arranged in rows of …, smallest square from tiles.
- Same remainder r: greatest divisor = HCF of (each number − r); least number = LCM + r.
- Different remainders: subtract each remainder first, then take the HCF.
- Change to one unit first (m to cm, minutes to seconds).
- Check whether "how many times together" counts the start.