Algorithm 3.2.2 and Algorithm 3.2.8 provide a way to determine the quotient and remainder of a division problem by repeatedly subtracting or adding the divisor. For larger numbers these methods become cumbersome.
Long division which is often introduced in early mathematics is an efficient alternative to the division algorithm. In Example 3.3.1 we show how you can easily read of the quotient and remainder from this process. We will revisit long division in Section 11.1 where we cover the decimal representation of integers. There you can find Example 11.1.4 that guides you through the steps of long division.
In the section on Calculator Long Division below we provide a second (often more practical) way to use a basic calculator to get the quotient and remainder of a division problem.
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. The methods presented below the size of the numbers of which you can compute quotients and remainders is only limited by the number of digits that your calculator can handle. In the video in Figure 3.3.2 we introduce this method. This is followed by a detailed description of the strategy and more examples.
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.
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:
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:
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:
When we divide a positive integer \(a\) by an integer \(b\) that is greater than \(a\) we can easily read off \(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.
Example3.3.5.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.3.1 to compute the quotient \(q=10\fdiv 55\) and remainder \(r=10\fmod 55\) of the division of \(10\) by \(55\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.
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:
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.