Division Algorithm and Checking: Formula and Examples

What is the division algorithm?

The division algorithm is a fundamental mathematical rule stating that any whole number can be divided by a non-zero integer to produce a unique quotient and a unique remainder.

When working with basic arithmetic, identifying the dividend, divisor and quotient is the first step. The dividend is the total amount being divided, the divisor is the number of groups or the size of each group, and the quotient is the resulting whole number of complete groups.

If the total cannot be divided equally, a remainder is left over. The division algorithm combines these four values into a predictable, mathematically true equation.

The dividend-divisor-quotient-remainder equation

The division identity clearly defines the relationship between the four fundamental parts of a division calculation. This forms the core dividend-divisor-quotient-remainder formula:

$\text{Dividend}=(\text{Divisor}\times \text{Quotient})+\text{Remainder}$

Multiplying the divisor by the quotient and adding the remainder will always recreate the original dividend.

This relationship is an extension of multiplication and division fact families. Because division is the inverse operation of multiplication, every division equation can be rewritten as a related multiplication equation. Adding the remainder accounts for the portion of the dividend that could not form a complete group.

How to check division

To verify a division answer, you can use the quotient remainder formula. This ensures no arithmetic mistakes were made during calculation.

Use the following steps to verify your division answer:

1. Identify the divisor, the quotient, and the remainder from your calculation.
2. Multiply the divisor by the quotient.
3. Add the remainder to the product from the previous step.
4. Compare the final sum to the original dividend. If the numbers match exactly, the calculation is verified.
   

Checking your work is highly recommended when performing long division, where multiple steps increase the likelihood of small arithmetic errors.

Why the remainder is bounded

When performing division with remainders, the remainder is strictly limited by the size of the divisor. A valid remainder must be greater than or equal to zero, but it must remain strictly less than the divisor.

$0\le \text{Remainder}<\text{Divisor}$

If the remainder equals or exceeds the divisor, it means another full group can still be formed, so the division is incomplete. For example, when dividing by $6$, the only possible whole-number remainders are $0$, $1$, $2$, $3$, $4$, and $5$.

From arithmetic checking to Euclid's division lemma

In later grades, the arithmetic check is formalized algebraically as Euclid's division lemma. This mathematical rule describes the exact same dividend-divisor relationship using variables.

For any two positive integers $a$ (the dividend) and $b$ (the divisor), there exist unique integers $q$ (the quotient) and $r$ (the remainder) such that:

a = bq + r

where $0\le r<b$.

This formal statement confirms that division is always exact and predictable. It also serves as the foundation for the Euclidean algorithm, a repeated procedure used to find the highest common factor of two numbers.

Worked examples

The formula applies equally to verifying simple calculations and finding unknown components.

Example 1: Verifying a basic division

Question: Verify that $59÷8=7$ with a remainder of $3$.

Method:

1. Identify the parts: the dividend is $59$, the divisor is $8$, the quotient is $7$, and the remainder is $3$.
2. Check the remainder bound: The remainder $3$ is strictly less than the divisor $8$.
3. Multiply the divisor by the quotient: $8\times 7=56$.
4. Add the remainder: $56+3=59$.

Answer: The sum equals the original dividend of $59$, proving the division is exact and correct.

Check: Ensure no other multiplication fact fits. $8\times 8=64$, which is larger than $59$, confirming the quotient must be $7$.

Example 2: Finding a missing dividend

Question: A number is divided by $12$. The quotient is $15$ and the remainder is $5$. What is the original number?

Method:

1. State the formula: $\text{Dividend}=(\text{Divisor}\times \text{Quotient})+\text{Remainder}$.
2. Substitute the given values: $\text{Dividend}=(12\times 15)+5$.
3. Perform the multiplication: $12\times 15=180$.
4. Add the remainder: $180+5=185$.

Answer: The missing dividend is $185$.

Check: Work backwards. Divide $185$ by $12$. $12\times 10=120$, leaving $65$. $12\times 5=60$, leaving $5$. The quotient is $15$ with a remainder of $5$.

Example 3: Writing Euclid's division lemma

Question: Apply Euclid's division lemma to express the relationship when dividing $74$ by $9$.

Method:

1. Identify the two positive integers: $a=74$ and $b=9$.
2. Find the largest multiple of $9$ that does not exceed $74$. The multiple is $9\times 8=72$. So, the unique integer quotient is $q=8$.
3. Subtract this multiple from the dividend to find the remainder: $74-72=2$. So, the unique integer remainder is $r=2$.
4. Write the relationship in the form $a=bq+r$.

Answer: The relationship is $74=(9\times 8)+2$.

Check: Verify the remainder rule $0\le r<b$. The remainder $2$ is greater than zero and less than the divisor $9$.

Common mistakes

When using the division algorithm, students frequently make these predictable errors:

• Forgetting to add the remainder: When checking a division calculation, multiplying the divisor by the quotient only verifies the complete groups. If the remainder is left out of the check, the final sum will not match the original dividend.
• Allowing a remainder larger than the divisor: A common error during long division is stopping before the total is fully divided. If the remainder is equal to or larger than the divisor, the quotient is too small and the calculation is incomplete.
• Confusing the divisor and the dividend: Placing the larger number outside the division bracket by accident changes the entire problem, often producing fractional or decimal results where a whole number was expected.

Frequently asked questions

Can the remainder be zero?

Yes. If a number divides perfectly into another number without leaving anything behind, the remainder is zero. In this case, the division equation simply becomes $\text{Dividend}=\text{Divisor}\times \text{Quotient}$.

What happens if the divisor is larger than the dividend?

If you attempt to divide a smaller whole number by a larger whole number, the quotient is $0$ because no complete groups can be made. The remainder is exactly equal to the original dividend. For example, $4÷7$ yields a quotient of $0$ and a remainder of $4$.

Does the division algorithm work for negative numbers?

Yes. The theorem extends to negative integers as well. However, the rule $0\le r<|b|$ must be carefully applied so the remainder remains positive, which can shift the quotient differently than standard whole-number division.