Number System: formulas, shortcuts & solved examples
What it is
The number system covers the properties of integers: how they divide, what remainders they leave, how many factors they have and how their last digits behave. These questions test reasoning more than heavy calculation, and a handful of rules solve the majority of them.
Key formulas and rules
Divisibility rules
- 2: last digit even.
- 3: sum of digits divisible by 3.
- 4: last two digits divisible by 4.
- 5: last digit 0 or 5.
- 8: last three digits divisible by 8.
- 9: sum of digits divisible by 9.
- 11: difference between the sums of alternate digits is 0 or a multiple of 11.
Factors
If N = a^p × b^q × c^r, where a, b, c are distinct primes:
- Number of factors = (p + 1)(q + 1)(r + 1)
- Sum of factors = [(a^(p+1) − 1)/(a − 1)] × [(b^(q+1) − 1)/(b − 1)] × [(c^(r+1) − 1)/(c − 1)]
Sums of series
- Sum of the first n natural numbers = n(n + 1)/2
- Sum of their squares = n(n + 1)(2n + 1)/6
- Sum of their cubes = [n(n + 1)/2]²
Trailing zeros in n!
Number of trailing zeros = ⌊n/5⌋ + ⌊n/25⌋ + ⌊n/125⌋ + …
Remainders
- The remainder of a product equals the product of the remainders (taken again mod the divisor).
- If a^k leaves remainder 1 when divided by d, then powers of a repeat their remainders in cycles of k.
Shortcuts
Shortcut 1: Unit digit cycles
Unit digits of powers repeat in cycles of at most 4. For 2: 2, 4, 8, 6. For 3: 3, 9, 7, 1. For 7: 7, 9, 3, 1. For 8: 8, 4, 2, 6. Digits 0, 1, 5 and 6 never change. Divide the power by 4 and use the remainder (a remainder of 0 means the fourth term).
Shortcut 2: Find a power that gives remainder 1
To find 2^100 mod 7, notice 2³ = 8 leaves remainder 1. Break the power into multiples of 3 and the rest disappears.
Shortcut 3: Digit-sum check
Before long division by 3 or 9, add the digits. This eliminates wrong options in seconds.
Solved examples
Example 1: Unit digit
Find the unit digit of 7^43.
Solution: The cycle for 7 is 7, 9, 3, 1. Since 43 = 4 × 10 + 3, the unit digit is the third term in the cycle, 3.
Example 2: Number of factors
How many factors does 360 have?
Solution: 360 = 2³ × 3² × 5¹. Number of factors = (3 + 1)(2 + 1)(1 + 1) = 4 × 3 × 2 = 24.
Example 3: Remainder of a large power
Find the remainder when 2^100 is divided by 7.
Solution: 2³ = 8 leaves remainder 1 on division by 7. Write 2^100 = (2³)^33 × 2. The first part leaves remainder 1, so the overall remainder is 1 × 2 = 2.
Example 4: Sum and trailing zeros
Find the sum of the first 50 natural numbers and the number of trailing zeros in 100!.
Solution: Sum = 50 × 51 / 2 = 1,275. Trailing zeros in 100! = ⌊100/5⌋ + ⌊100/25⌋ = 20 + 4 = 24.
Common mistakes
- Counting factors from a non-prime breakdown. 360 = 8 × 45 does not give the factor count directly; break into primes first.
- Misreading a remainder of 0 in unit-digit cycles. If the power is a multiple of 4, use the fourth (last) term of the cycle, not the first.
- Forgetting higher powers of 5 in factorials. For 100!, 25 contributes an extra 5, so ⌊100/25⌋ must be added.
- Treating 1 as prime. 1 is neither prime nor composite, and including it in prime factorisation causes errors.
- Applying the rule for 11 incorrectly. The difference of alternate digit sums can be 0 as well as 11, 22 and so on; zero also means divisible.
Quick recap
Break numbers into primes, use cycles for unit digits and remainders, and keep the divisibility rules and series formulas handy. Number system questions often look heavy but collapse to a few lines once the right rule is identified.
Practice now: https://www.testsworld.com/mocks