A Formula That Underpins Every Calculator Division
Every long division you've ever done sits on this one identity.
The dividend divisor quotient remainder formula is:
$$\text{Dividend} = \text{Divisor} \times \text{Quotient} + \text{Remainder}.$$
For $47 \div 5$: the divisor is $5$, the quotient is $9$ (since $5 \times 9 = 45$), and the remainder is $2$. Plug in: $47 = 5 \times 9 + 2$. The formula always checks out.
The Formula
For non-negative integers (or any integers, with appropriate sign conventions):
$$\boxed{;D = d \cdot q + r, \quad \text{where } 0 \leq r < d;}$$
with $D$ = dividend, $d$ = divisor, $q$ = quotient, $r$ = remainder.
Reverse forms — solve for any single unknown given the other three:
$$D = dq + r \quad\Leftrightarrow\quad q = \frac{D - r}{d} \quad\Leftrightarrow\quad d = \frac{D - r}{q} \quad\Leftrightarrow\quad r = D - dq.$$
Quick facts.
Formal name: the Division Algorithm (also called Euclidean division).
Theorem: for any integers $D$ and $d > 0$, there exist unique integers $q$ and $r$ with $D = dq + r$ and $0 \leq r < d$.
Grade introduced: CCSS-M 4.NBT.B.6 — multi-digit division; NCERT Class 4 / Class 6 — Division chapters.
Special case: when $r = 0$, the divisor divides the dividend exactly, written $d \mid D$.
Why the Formula Works — The Repeated-Subtraction View
Division is repeated subtraction. To divide $D$ by $d$, subtract $d$ from $D$ over and over until what's left is smaller than $d$. The number of subtractions is the quotient; what's left is the remainder.
For $47 \div 5$:
$47 - 5 = 42$ (count: $1$)
$42 - 5 = 37$ (count: $2$)
... continuing ...
$7 - 5 = 2$ (count: $9$).
You stop because $2 < 5$. So the quotient is $9$ and the remainder is $2$. Putting that algebraically:
$$47 = \underbrace{5 + 5 + \ldots + 5}_{9 \text{ times}} + 2 = 5 \cdot 9 + 2.$$
The formula is just the compact statement of repeated subtraction.
Three Worked Examples, From Quick to Stretch
Quick. Find the quotient and remainder when $73$ is divided by $8$.
$8 \times 9 = 72$, so the quotient is $9$ and the remainder is $73 - 72 = 1$.
Check: $73 = 8 \times 9 + 1 = 72 + 1 = 73$. ✓
Final answer: Quotient $9$, remainder $1$.
Standard (Wrong-Path-First). Given dividend $156$, quotient $12$, and remainder $0$. Find the divisor.
Wrong path. A student in our McKinney TX Grade 5 cohort once wrote: "Divisor $= \text{Dividend} - \text{Quotient} = 156 - 12 = 144$." That subtracts the quotient from the dividend — but the relationship is multiplicative, not subtractive. The correct identity is $D = dq + r$, which rearranges to $d = (D - r)/q$.
Correct. With $D = 156$, $q = 12$, $r = 0$:
$$d = \frac{D - r}{q} = \frac{156 - 0}{12} = \frac{156}{12} = 13.$$
Final answer: Divisor $= 13$.
Cross-check: $13 \times 12 + 0 = 156$. ✓
Stretch. A bakery makes $1247$ cookies in a day. The cookies are packed into boxes of $24$ each, and any leftover cookies are eaten by the staff. How many full boxes are produced, and how many cookies do the staff eat?
Apply the formula with $D = 1247$, $d = 24$:
$$1247 = 24 \cdot q + r, \quad 0 \leq r < 24.$$
$24 \times 50 = 1200$; $1247 - 1200 = 47$. But $47 > 24$, so continue: $24 \times 51 = 1224$; $1247 - 1224 = 23$. Since $23 < 24$, stop.
So $q = 51$, $r = 23$.
Final answer: $51$ full boxes are produced; the staff eat $23$ cookies.
Where the Formula Lives — Beyond Long Division
The division algorithm is the foundation of several areas of math and computing.
The Euclidean algorithm. Finding $\gcd(a, b)$ uses repeated application of $D = dq + r$. The famous Euclidean algorithm — over $2300$ years old, written down by Euclid around $300$ BCE — runs by computing remainders until they hit zero.
Modular arithmetic. Writing $a \equiv b \pmod{m}$ means "$a$ and $b$ leave the same remainder when divided by $m$." Modular arithmetic underpins clock arithmetic, calendar computations, RSA cryptography, and every check-digit algorithm (credit card numbers, ISBNs, barcodes).
Computer integer division. Every CPU instruction set has a
div(oridiv) operation that produces both quotient and remainder in one step — directly implementing this formula.The Chinese Remainder Theorem. A 4th-century result by Sun Zi that finds an integer given its remainders under several moduli — the building block of modern cryptographic protocols.
Polynomial division. The polynomial division algorithm $P(x) = D(x) \cdot Q(x) + R(x)$ has the exact same shape as the integer formula. The Factor Theorem and Remainder Theorem in high-school algebra are direct consequences.
The formula is elementary. Its mathematical descendants run modern cryptography.
Three Habits That Lose Marks on Division
1. Allowing the remainder to equal or exceed the divisor.
Where it slips in: Hand-long-division problems where the next-largest multiple is misjudged.
Don't do this: Write $47 \div 5 = $ "quotient $8$, remainder $7$."
The correct way: The remainder must satisfy $0 \leq r < d$. If $r \geq d$, the quotient is too small — increase it by $1$ and reduce the remainder by $d$. For $47 \div 5$: quotient $9$, remainder $2$ — not quotient $8$, remainder $7$.
2. Confusing dividend with divisor.
Where it slips in: Word problems where the "split into" language flips intuition.
Don't do this: For "split $30$ apples among $6$ children," compute $6 \div 30$.
The correct way: The dividend is what's being divided (the apples — $30$). The divisor is the number of equal parts (the children — $6$). $30 \div 6 = 5$. Roughly four out of every ten Grade 5 students in our Bhanzu cohorts confuse the two on word problems — the fix is to write "Total ÷ Per group" or "What we have ÷ How we share it" before computing.
3. Forgetting the remainder when the question asks for a real-world answer.
Where it slips in: Word problems where the answer depends on what to do with leftovers.
Don't do this: For "how many full boxes of $24$ from $100$ cookies?" write $100 \div 24 = 4.166$ and round to $4.17$.
The correct way: Decimals don't belong in integer-division problems. $100 = 24 \times 4 + 4$ — so $4$ full boxes and $4$ leftover cookies. Always think integer quotient + integer remainder for real-world counting problems.
4. Misapplying the formula with negative dividends — the convention trap.
Where it slips in: Problems involving signed division, especially in programming contexts.
Don't do this: Assume $(-7) \div 3$ gives quotient $-3$, remainder $+2$ universally.
The correct way: Mathematical convention (Euclidean): the remainder is always non-negative, so $(-7) = 3 \cdot (-3) + 2$ — quotient $-3$, remainder $+2$. Most programming languages (C, Java) use truncated division: $(-7) = 3 \cdot (-2) + (-1)$ — quotient $-2$, remainder $-1$. These differ. A real-world version: the Ariane 5 V88 failure (1996) wasn't strictly a division convention issue, but it was a convention mismatch — reused software made assumptions that no longer held. Always know which division convention your context uses before reasoning about signs.
The Mathematicians Behind the Division Algorithm
The integer division formula isn't anyone's personal discovery — it's been used implicitly since humans counted livestock — but the theorem that quotient and remainder are unique is named for one mathematician.
Euclid (c. 325–c. 265 BCE, Greece) stated the algorithm for finding $\gcd(a, b)$ via repeated division in Elements, Book VII, Proposition 1 (around 300 BCE). The Division Algorithm — the statement that for integers $a$ and $b > 0$, unique integers $q$ and $r$ exist with $a = bq + r, 0 \leq r < b$ — appears in Book VII as a building block. The algorithm's modern name honours its placement in this work.
Diophantus of Alexandria (c. 200–284 CE) used the division identity systematically when solving linear equations with integer constraints — the kind of equations now called Diophantine equations.
Brahmagupta (598–668 CE, India) gave the first complete treatment of integer division including negative integers and zero in Brahmasphutasiddhanta (628 CE) — a thousand years before negative numbers were accepted in European math. The convention "remainder is non-negative" is essentially Brahmagupta's.
Three names; over $2000$ years; one identity that any Grade 5 student in McKinney, Texas can verify with a piece of paper.
Conclusion
The dividend divisor quotient remainder formula is $D = dq + r$ with $0 \leq r < d$.
The four reverse formulas — solving for any single unknown — follow by rearrangement.
The formula is the algebraic version of repeated subtraction: subtract $d$ from $D$ until what's left is smaller than $d$.
The most common mistake is allowing $r \geq d$ — always check the remainder is strictly less than the divisor.
The same shape powers the Euclidean algorithm, modular arithmetic, polynomial division, and modern cryptography.
Take Division for a Test Drive
Try these three before moving on. If you trip on the remainder bound, come back to Mistake 1.
Find the quotient and remainder when $1000$ is divided by $37$.
The dividend is $245$, the quotient is $17$, and the remainder is $7$. Find the divisor.
A library has $452$ books to shelve. Each shelf holds $24$ books. How many full shelves are filled, and how many books remain on the trolley?
Want a live Bhanzu trainer to walk through more dividend divisor quotient remainder formula problems with your child? Book a free demo class — online globally.
Was this article helpful?
Your feedback helps us write better content