SSC CGL Maths · Number System
Division Algorithm and Multiples
Every division gives a quotient and a remainder smaller than the divisor, and the remainder tells you exactly how far a number is from the nearest multiples.
Why this matters
Eight questions in the bank, seven EASY and one MODERATE. They all use one equation, dividend equals divisor times quotient plus remainder: forwards to rebuild a dividend, and backwards to find the nearest multiple of a number or the least amount to add or take away.
Concept 1 of 2: The division algorithm
Definition
- Dividend divisor quotient remainder, and the remainder is at least 0 and less than the divisor.
- 'Exactly divisible' means the remainder is 0.
- When a stem links the divisor to the quotient and the remainder ('the divisor is 6 times the remainder'), start from the one number it gives you directly and follow the links one at a time.
- Fast route for an exact division where the dividend and the divisor are both changed by a percentage: the new quotient is the old one times the dividend's factor over the divisor's factor. If the dividend is raised by 20% and the divisor cut by 25%, the quotient becomes .
Division algorithm
Worked example
Practice this conceptself-check · 4 quick reps
The same idea in a real exam question:
Example 1 · Number System · Division Algorithm and Multiples
Accepting a remainder as large as the divisor
Scaling the quotient of a division that had a remainder
Concept 2 of 2: The nearest multiple of a number
Definition
- Divide: .
- Largest multiple of not above : . So the least number to subtract is .
- Smallest multiple of not below : when . So the least number to add is .
- Largest -digit multiple: take (the largest -digit number) and subtract the remainder.
- Smallest -digit multiple: take (the smallest -digit number) and add .
- Fast route: you rarely need the full division. Jump to a round multiple first (), then take away or add small multiples of until you reach .
Distance to the nearest multiples
- Nthe given number
- dthe divisor
- rthe remainder when N is divided by d
Worked example
Practice this conceptself-check · 4 quick reps
The same idea in a real exam question:
Example 2 · Number System · Division Algorithm and Multiples
Adding the remainder instead of the gap
Landing on a multiple with the wrong number of digits
Summary — formulas & gotchas at a glance
A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.
Formulas (2)
- The division algorithm
Division algorithm
- The nearest multiple of a number
Distance to the nearest multiples
Watch out for (4)
- Accepting a remainder as large as the divisor→ The division algorithm
- Scaling the quotient of a division that had a remainder→ The division algorithm
- Adding the remainder instead of the gap→ The nearest multiple of a number
- Landing on a multiple with the wrong number of digits→ The nearest multiple of a number
Test yourself on Number System
20 past SSC CGL questions from this chapter, timed at 12 minutes and marked the way the exam marks it. You see your score and every answer the moment you finish. Free to start.