Question bank — Division — long division, remainder, dividend - divisor - quotient vocabulary

Reading the figure (for the mental model): the long horizontal strip is the dividend drawn as little cells in a row. Moving left to right, the cells are bundled into whole coloured blocks each exactly cells wide — there are such blocks (teal, orange, plum), each with a double-headed arrow underneath labelling it as "one whole block of size ". After the third block, only hatched cells are left (top orange arrow, "remainder "): they are too short to fill a fourth block, which is precisely the picture-reason that . Almost every answer below is just this strip with different numbers.
True or false — justify
Recall Fire the questions
A remainder of means the divisor divides the dividend exactly. ::: True — leftover means the dividend is a whole multiple of the divisor, i.e. . In rem , the numbers and can be swapped without changing the meaning. ::: False — shares into groups of ; shares into groups of (giving rem ). Dividend and divisor play different roles. The remainder can be as large as the divisor. ::: False — it must be strictly less: . If you have one more whole group, which belongs in the quotient. If you divide any number by , the remainder is always . ::: True — every group of size fits perfectly, so ; there is never anything left over. Dividing a smaller number by a bigger number is impossible. ::: False — it just gives quotient and the whole number as remainder: rem , since . The quotient of is always smaller than (for whole and divisor ). ::: True — dividing into groups larger than can only reduce the count, so ; equality would need . Doubling both the dividend and the divisor keeps the quotient the same and doubles the remainder. ::: True — start from . Multiply the whole line by : . So dividing by gives the same with new remainder . It stays valid because means , so is still a legal remainder. Example: rem becomes rem . A number divides itself exactly. ::: True — rem , since exactly one group of size fits into .
Spot the error
Recall Find what's wrong
A student writes rem . What broke the rule? ::: The remainder is larger than the divisor , so another group fits. Correct it to rem (since ). A student computes and writes quotient . What step was skipped, and where does the go? ::: They forgot a placeholder . Column by column: (write , rem ); bring down , and , so write in the quotient (this is the skipped digit); bring down , , write another ; bring down , . Quotient , not . The two middle s hold the hundreds and tens places. A student checks rem by computing and comparing. Is that a valid check? ::: No — the check is , matching the dividend. Re-dividing the quotient tests nothing. A student says "." Why is that nonsense? ::: Zero groups of anything is zero: rem , since . Sharing no sweets gives each kid nothing. A student says "." What's the real problem? ::: Division by is undefined — no quotient makes , because is always . The equation has no solution, which is why the domain forbids . A student concludes has a remainder because is odd. Is that reasoning sound? ::: No — oddness only tells you about dividing by . In fact exactly, remainder . Parity says nothing about divisibility by .
Why questions
Recall The reasoning behind the rules
Why must the remainder be strictly less than the divisor? ::: If it equalled or exceeded the divisor, another full group could be removed, so the quotient wasn't the true count of whole groups. See Modular Arithmetic & Remainders. Why does long division start from the biggest place value, not the smallest? ::: A leftover in a big place (say a leftover hundred) is worth ten of the next place down, so it must be carried downward. Starting big lets each leftover flow into the next column cleanly. Why does "bring down the next digit" actually work? ::: A leftover in one column is really that many tens of the next column; bringing the next digit down glues the leftover-tens to the new units, forming the exact number to divide next. It's pure place value. Why is division called the inverse of multiplication? ::: Because rebuilds the dividend by multiplying the divisor and quotient back up. With remainder , division perfectly undoes multiplication — see Multiplication — repeated addition. Why can the digit-sum test check divisibility by but not by ? ::: Because (i.e. leaves remainder mod ), each place value contributes just its digit's remainder; for , powers of leave a messy repeating pattern of remainders, so no clean digit-sum shortcut exists. Why does a remainder of let us write the division as a whole-number fraction? ::: Because means exactly, a whole number — see Fractions as Division. A non-zero remainder leaves a genuine fractional part.
Edge cases
Recall The boundary scenarios
What is the quotient and remainder of ? ::: Quotient , remainder : no whole to share means no groups and nothing left, and . What happens to the remainder when the dividend is a multiple of the divisor? ::: The remainder is exactly — the whole amount splits into complete groups with nothing left, the definition of "divides exactly." Divide by : what are quotient and remainder, and why is this the boundary? ::: Quotient , remainder . It's the smallest dividend for which divisor makes even one whole group. Divide by : how does the algorithm handle a divisor larger than the dividend? ::: Quotient , remainder — zero full groups fit, so the entire dividend is left over, and . What is the largest possible remainder when dividing by ? ::: — the remainder can run from up to , but never reach itself. If a number leaves remainder when divided by both and , must it leave remainder when divided by ? ::: Not necessarily — it need only be a multiple of the LCM, which is (e.g. works but isn't a multiple of ). See HCF and LCM. Can the quotient ever be larger than the dividend (for whole , divisor )? ::: No — rearrange the identity to . Since we have , and since dividing by can only shrink or hold: . So , with equality only when and . (A divisor below — a fraction — is what would let exceed , but that leaves the whole-number domain.) How is handled, and why isn't the remainder ? ::: The identity keeps , so we step past to the next lower multiple of , which is : , giving quotient , remainder . A "" would break the rule. When the divisor is negative, e.g. , what keeps the remainder valid? ::: The remainder must satisfy , using the size of the divisor. Here : quotient , remainder — still in . And the fourth sign case: — both negative — what are quotient and remainder? ::: Keep . Step down to the multiple of at or below , namely : , so quotient (positive, since two negatives multiply up) and remainder . This completes all four sign quadrants: (+,+), (−,+), (+,−), (−,−).
Connections
- Division — long division, remainder, dividend - divisor - quotient vocabulary (parent)
- Multiplication — repeated addition
- Factors, Multiples & Divisibility Rules
- Modular Arithmetic & Remainders
- Fractions as Division
- Prime Factorisation
- HCF and LCM