HCF × LCM = product of the two numbers. Example: 36 and 48 have HCF 12, LCM 144, and 12 × 144 = 36 × 48 = 1728.
HCF and LCM of fractions.
HCF of fractions = HCF of numerators / LCM of denominators. LCM of fractions = LCM of numerators / HCF of denominators (fractions in lowest terms).
Divisibility rules for 2, 3, 4, 5, 6, 8, 9.
2: last digit even. 3: digit sum divisible by 3. 4: last two digits divisible by 4. 5: ends in 0 or 5. 6: divisible by 2 and 3. 8: last three digits divisible by 8. 9: digit sum divisible by 9.
Divisibility rule for 11.
Difference between the sum of digits at odd places and the sum at even places is 0 or a multiple of 11. Example: 2728 → (2 + 2) − (7 + 8) = −11, so divisible.
Divisibility rules for 7, 13 and the 1001 trick.
Since 7 × 11 × 13 = 1001: split a number into groups of three digits from the right and subtract alternate groups; if the result is divisible by 7, 11 or 13 then so is the number.
Divisibility by 12, 15, 18, 24.
Check coprime factors: 12 = 3 × 4; 15 = 3 × 5; 18 = 2 × 9; 24 = 3 × 8. The number must be divisible by both factors.
How do you find the unit digit of a power?
Apply the cycle of the last digit: 2 → 2, 4, 8, 6; 3 → 3, 9, 7, 1; 7 → 7, 9, 3, 1; 8 → 8, 4, 2, 6; 4 → 4, 6; 9 → 9, 1; 0, 1, 5, 6 never change. Divide the exponent by the cycle length.
Number of factors of a number N = p^a × q^b × r^c.
Total factors = (a + 1)(b + 1)(c + 1). Sum of factors = [(p^(a+1) − 1)/(p − 1)] × … Product of factors = N^(factors/2).
Number of odd and even factors.
Odd factors = number of factors of the odd part; even factors = total − odd. Example: 72 = 2³ × 3² has 12 factors; odd factors are 1, 3, 9 (3 of them), so even factors = 12 − 3 = 9.
How do you find the greatest number that divides a, b, c leaving remainders r1, r2, r3?
HCF of (a − r1), (b − r2), (c − r3). If the remainder is the same r, HCF of (a − r), (b − r), (c − r) or of the differences.
Smallest number that leaves remainder r when divided by a, b, c.
LCM(a, b, c) + r. If instead the difference (divisor − remainder) is the same d, the answer is LCM − d.
When will two bells ringing at intervals meet again?
After the LCM of their intervals. Example: bells at 6, 8 and 12 minutes ring together after LCM = 24 minutes.
Sum rules: sum of first n natural numbers, odd numbers, even numbers, squares, cubes.
Remainder theorem shortcut: remainder of a^n divided by (a + 1).
(a)^n mod (a + 1) = (−1)^n mod (a + 1): remainder is 1 if n is even, a if n is odd. Example: 2^10 mod 3: 2 ≡ −1, so (−1)^10 = 1.
What is the digit sum (digital root) shortcut for checking multiplication?
A number's digital root = remainder when divided by 9. For a product, multiply the digital roots; it must match the root of the answer (a quick error check).
Square of numbers ending in 5.
n5² = n(n + 1) followed by 25. Example: 75² = 7 × 8 = 56, so 5625. 125² = 12 × 13 = 156 → 15625.