Skip to main content \(\newcommand{\longdivision}[2]{#1\big)\!\!\overline{\;#2}}
\newcommand{\mlongdivision}[2]{\longdivision{#1}{#2}}
\renewcommand{\emptyset}{\{\}}
\newcommand{\blanksp}{\underline{\hspace{.25in}}}
\newcommand{\set}[1]{\left\{#1\right\}}
\newcommand{\cspace}{-}
\newcommand{\Ta}{\mathtt{a}}
\newcommand{\Tb}{\mathtt{b}}
\newcommand{\Tc}{\mathtt{c}}
\newcommand{\Td}{\mathtt{d}}
\newcommand{\Te}{\mathtt{e}}
\newcommand{\Tf}{\mathtt{f}}
\newcommand{\Tg}{\mathtt{g}}
\newcommand{\Th}{\mathtt{h}}
\newcommand{\Ti}{\mathtt{i}}
\newcommand{\Tj}{\mathtt{j}}
\newcommand{\Tk}{\mathtt{k}}
\newcommand{\Tl}{\mathtt{l}}
\newcommand{\Tm}{\mathtt{m}}
\newcommand{\Tn}{\mathtt{n}}
\newcommand{\To}{\mathtt{o}}
\newcommand{\Tp}{\mathtt{p}}
\newcommand{\Tq}{\mathtt{q}}
\newcommand{\Tr}{\mathtt{r}}
\newcommand{\Ts}{\mathtt{s}}
\newcommand{\Tt}{\mathtt{t}}
\newcommand{\Tu}{\mathtt{u}}
\newcommand{\Tv}{\mathtt{v}}
\newcommand{\Tw}{\mathtt{w}}
\newcommand{\Tx}{\mathtt{x}}
\newcommand{\Ty}{\mathtt{y}}
\newcommand{\Tz}{\mathtt{z}}
\newcommand{\So}{\Tf}
\newcommand{\Sno}{\Tg}
\newcommand{\Si}{\Th}
\newcommand{\Sni}{\Tj}
\newcommand{\N}{\mathbb{N}}
\newcommand{\Z}{\mathbb{Z}}
\newcommand{\W}{\mathbb{W}}
\newcommand{\ZZ}{\Z}
\newcommand{\PP}{\mathbb{P}}
\newcommand{\Q}{\mathbb{Q}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\RR}{\R}
\newcommand{\F}{\mathbb{F}}
\newcommand{\A}{\mathbb{A}}
\newcommand{\abs}[1]{|#1|}
\newcommand{\fmod}{\bmod}
\newcommand{\fdiv}{\,\mathrm{div}\,}
\newcommand{\lcm}{\mathrm{lcm}}
\newcommand{\id}{\mathrm{id}}
\newcommand{\nr}[1]{\##1}
\newcommand{\gexp}[3]{#1^{#2 #3}}
\newcommand{\gexpp}[3]{\displaystyle\left(#1\right)^{#2 #3}}
\newcommand{\glog}[3]{\log_{#1}^{#3}#2}
\newcommand{\sol}[1]{{\color{blue}\textit{#1}}}
\newcommand{\gro}[1]{{\color{gray}#1}}
\newcommand{\todo}[1]{{\color{purple}TO DO: #1}}
\newcommand{\fixme}[1]{{\color{red}FIX ME: #1}}
\newcommand{\checkme}[1]{{\color{green}CHECK ME: #1}}
\newcommand{\degre}{^\circ}
\newcommand{\vect}[1]{\overrightarrow{#1}}
\newcommand{\nix}{}
\newcommand{\cox}[1]{\fcolorbox[HTML]{000000}{#1}{\phantom{M}}}
\newcommand{\tox}[1]{\texttt{\##1} \amp \cox{#1}}
\newcommand{\ttx}[1]{\texttt{\##1}}
\newcommand{\mox}[1]{\mathtt{\##1}}
\newcommand{\xx}{\mathtt{\#}}
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 3.3 Long Division
Algorithm 3.6 and
Algorithm 3.14 provide a way to determine the quotient and remainder of a division problem by repeatedly subtracting or adding a fixed value, and that process has a very different feel from the process of long division that is often introduced in early mathematics. While the steps provided in the Division Algorithm always produce the correct quotient and remainder for the division problem given by valid input values, the process could be quite long if the number of steps required is very big. So, we now provide a second (often more practical) way to use a basic calculator to get the quotient and remainder of a division problem.
Rather than laboriously writing out the algorithmic steps of long division, we will demonstrate the process by example.
Example 3.26 . \(300 \fdiv 16\) and \(300\fmod 16\) with long division.
Let \(a := 300\) and \(b := 16\text{.}\) We perform the following long division:
\begin{equation*}
\begin{array}{r}
18\\
16\enclose{longdiv}{300}\!\\
\underline{16\phantom{0}}\\
140\\
\underline{128}\\ 12 \end{array}
\end{equation*}
Then,
\(q = 18\) and
\(r = 12\text{,}\) and we write
\(300 \fdiv 16 = 18\) and
\(300\fmod 16 = 12\text{.}\)
With a calculator the process of finding
\(q=a\fdiv b\) and
\(r=a\fmod b\) for an integer
\(a\) and natural number
\(b\) can be shortened. In the video in
Figure 3.27 we introduce this method. This is followed by a detailed description of the strategy and more examples.
Figure 3.27. Long division by Matt Farmer and Stephen Steward We now give a detailed description of the process for finding quotients and remainders with a basic calculator.
Strategy 3.1 . Calculator Long Division.
Suppose we are given an integer
\(a\) and a natural number
\(b\text{.}\) We give a strategy for finding the quotient
\(a\fdiv b\) and the remainder
\(a\fmod b\) with a calculator.
(a)
To find \(a\fdiv b\) and \(a\fmod b\) we set up the long division problem:
\begin{equation*}
\mlongdivision{b}{a}
\end{equation*}
(b) Compute
\(a \div b\) with a calculator.
(c)
The quotient \(q\) is the biggest integer that is less than or equal to the numerical value of \(a \div b\text{.}\) If \(a\div b\) is an integer, then set \(q:=a\div b\text{,}\) otherwise, \(q\) is the integer to the left of \(a \div b\) on the number line. Place the entire quotient \(q\) on top of the long division:
\begin{equation*}
\begin{array}{r}
q\\
b\enclose{longdiv}{a}\!
\end{array}
\end{equation*}
(d)
Multiply \(b \cdot q\) and place that value under the long division:
\begin{equation*}
\begin{array}{r}
q\\
b\enclose{longdiv}{a}\!\\
b\!\cdot\!q
\end{array}
\end{equation*}
(e)
Subtract to get the remainder
\(r=a-(b\cdot q)\) (using
Theorem 3.20 ):
\begin{equation*}
\begin{array}{r}
q\\
b\enclose{longdiv}{a}\!\\
\underline{b\!\cdot\!q}\\
r
\end{array}
\end{equation*}
With calculator long division we conduct the division from
Example 3.26 .
Example 3.28 . Divide \(300\) by \(16\) with calculator long division.
We use
Strategy 3.1 to compute the quotient
\(q\) and remainder
\(r\) of the division of
\(300\) by
\(16\text{.}\)
(a)
Set up the long division problem:
\begin{equation*}
16\enclose{longdiv}{300}\!
\end{equation*}
(b) A calculator gives us that
\(300 \div 16 = 18.75\text{.}\)
(c)
The integer on the number line to the left of \(18.75\) is \(18\text{,}\) so we set \(q:=18\text{.}\) Place the entire quotient on top of the long division:
\begin{equation*}
\begin{array}{r}
18\\
16\enclose{longdiv}{300}\!\\
\end{array}
\end{equation*}
(d)
Multiply \(16 \cdot 18 = 288\) and place that value under the long division:
\begin{equation*}
\begin{array}{r}
18\\
16\enclose{longdiv}{300}\!\\
288
\end{array}
\end{equation*}
(e)
Subtract to get the remainder \(r = 300-288 = 12\text{:}\)
\begin{equation*}
\begin{array}{r}
18\\
16\enclose{longdiv}{300}\!\\
\underline{288}\\
12
\end{array}
\end{equation*}
We have found
\(q=300 \fdiv 16 = 18\) and
\(r=200\fmod 16=12\text{.}\)
In
Checkpoint 3.29 use the strategy described above to find the quotient and remainder.
Checkpoint 3.29 . Quotient and remainder with long division.
The strategy also for division of a negative integer.
Example 3.30 . Divide \(-457\) by \(24\) with calculator long division.
We use
Strategy 3.1 to compute the quotient
\(q\) and remainder
\(r\) of the division of
\(a=-457\) by
\(b=24\text{.}\)
(a)
Set up the long division problem:
\begin{equation*}
24\enclose{longdiv}{-457}\!
\end{equation*}
(b) A calculator gives us that
\(-457 \div 24 = -19.0416\dots\text{.}\)
(c)
The integer on the number line to the left of \(-19.0416\dots\) is \(-20\) so we set \(q := -20\text{.}\) Place the entire quotient on top of the long division:
\begin{equation*}
\begin{array}{r}
-20\\
24\enclose{longdiv}{-457}\!
\end{array}
\end{equation*}
(d)
Multiply \(24 \cdot (-20) = -480\) and place that value under the long division:
\begin{equation*}
\begin{array}{r}
-20\\
24\enclose{longdiv}{-457}\!\\
-480
\end{array}
\end{equation*}
(e)
Subtract to get the remainder \(r = -457 - (-480) = 23\text{:}\)
\begin{equation*}
\begin{array}{r}
-20\\
24\enclose{longdiv}{-457}\!\\
\underline{-480}\\
23
\end{array}
\end{equation*}
Then
\(q=-20\) and
\(r=23\text{.}\) So we have
\(-457 \fdiv 24 = -20\) and
\(-457\fmod 24= 23\text{.}\)
In
Checkpoint 3.31 use the strategy described above to find the quotient and remainder.
Checkpoint 3.31 . Quotient and remainder with long division.
When we divide a positive integer
\(a\) by an integer
\(b\) that is greater than
\(a\) we can easily read of
\(a\fdiv b\) and
\(a\fmod b\text{.}\) Namely we have
\(a\fdiv b=0\) and
\(a\fmod b=a\text{.}\) Nevertheless, we consider this case an example, to see how our strategy performs in this case.
Example 3.32 . Divide \(10\) by \(55\) with calculator long division.
We find
\(10 \fdiv 55\) and
\(10\fmod 55\text{.}\) Let
\(a = 10\) and
\(b = 55\text{.}\) We use
Strategy 3.1 to compute the quotient
\(q=10\fdiv 55\) and remainder
\(r=10\fmod 55\) of the division of
\(10\) by
\(55\text{.}\)
(a)
Set up the long division problem:
\begin{equation*}
55\enclose{longdiv}{10}\!
\end{equation*}
(b) A calculator gives us that
\(10 \div 55 = 0.18\dots\text{.}\)
(c)
The integer on the number line to the left of \(0.18\dots\) is \(q = 0\text{.}\) Place the entire quotient on top of the long division:
\begin{equation*}
\begin{array}{r}
0\\
55\enclose{longdiv}{10}\!
\end{array}
\end{equation*}
(d)
Multiply \(55 \cdot 0 = 0\) and place that value under the long division:
\begin{equation*}
\begin{array}{r}
0\\
55\enclose{longdiv}{10}\!\\
0
\end{array}
\end{equation*}
(e)
Subtract to get the remainder \(r = 10 - 0 = 10\text{:}\)
\begin{equation*}
\begin{array}{r}
0\\
55\enclose{longdiv}{10}\!\\
\underline{\phantom{0}0}\\
10
\end{array}
\end{equation*}
Then,
\(q = 0\) and
\(r = 10\text{,}\) and we have
\(10 \fdiv 55 = 0\) and
\(10\fmod 55=10\text{.}\)
When
\(a\div b\) is an integer then the quotient
\(a\fdiv b\) is equal to
\(a\div b\) and the remainder is zero. We demonstrate that we also obtain this result using our calculator long division strategy.
Example 3.33 . Divide \(480\) by \(160\) with calculator long division.
We find
\(480\fdiv 160\) and
\(480\fmod 160\text{.}\) We use
Strategy 3.1 .
(a)
Set up the long division problem:
\begin{equation*}
160\enclose{longdiv}{480}\!
\end{equation*}
(b) A calculator gives us that
\(480 \div 160 = 3\text{.}\)
(c)
As \(480 \div 160\) is an integer we set \(q:=480 \div 160 = 3\text{.}\) Place the entire quotient on top of the long division:
\begin{equation*}
\begin{array}{r}
3\\
160\enclose{longdiv}{480}\!
\end{array}
\end{equation*}
(d)
Multiply \(160 \cdot 3 = 480\) and place that value under the long division:
\begin{equation*}
\begin{array}{r}
3\\
160\enclose{longdiv}{480}\!\\
480
\end{array}
\end{equation*}
(e)
Subtract to get the remainder \(r:= 480-480=0\text{:}\)
\begin{equation*}
\begin{array}{r}
3\\
160\enclose{longdiv}{480}\!\\
\underline{480}\\
0
\end{array}
\end{equation*}
So
\(q = 3\) and
\(r = 0\text{,}\) and we have
\(480 \fdiv 160 = 3\) and
\(480\fmod 160=0\text{.}\)
In practice we often do not explicitly write down all steps of the strategy.
Example 3.34 . \(9087 \fdiv 87\) and \(9087\fmod 87\) with calculator long division.
We compute \(9087 \fdiv 87\) and \(9087 \fmod 87\text{.}\) A calculator gives us:
\begin{equation*}
9087 \div 87 = 104.4482...\text{.}
\end{equation*}
The closest integer to the left of \(104.4482..\text{.}\) on the number line is \(104\text{.}\) This is the quotient. Now we use it to compute the remainder:
\begin{equation*}
9087 - 104 \cdot 87 = 39
\end{equation*}
We have found
\(9087 \fdiv 87 = 104\) and
\(9087 \fmod 87 = 39\text{.}\)
Similarly we shorten the process of dividing a negative number.
Example 3.35 . \(-107 \fdiv 72\) and \(-107\fmod 72\) with calculator long division.
We compute \(-107 \fmod 72\) and \(-107 \fdiv 72\) with a calculator. We have
\begin{equation*}
-107 \div 72 = -1.48611...\text{.}
\end{equation*}
The integer on the number line to the left of
\(-1.48611..\text{.}\) is
\(-2\) (starting at -1.48611 we go left on the number line until we find an integer). Thus
\(-2\) is the quotient.
Now we compute the remainder by subtracting the quotient \(-2\) times \(72\) from \(-107\text{.}\)
\begin{equation*}
-107 - (-2)\cdot 72 = -107 - (-144) = -107+144 = 37
\end{equation*}
We have computed
\(-107 \fdiv 72 = -2\) and
\(-107 \fmod 72 = 37\text{.}\)
In
Checkpoint 3.36 apply the strategy used above to find quotients and remainders.
Checkpoint 3.36 . Quotients and remainders.
