Long division


In arithmetic, long division is a standard division algorithm suitable for dividing multi-digit Hindu-Arabic numerals that is simple enough to perform by hand. It breaks down a division problem into a series of easier steps.
As in all division problems, one number, called the dividend, is divided by another, called the divisor, producing a result called the quotient. It enables computations involving arbitrarily large numbers to be performed by following a series of simple steps. The abbreviated form of long division is called short division, which is almost always used instead of long division when the divisor has only one digit.

History

Related algorithms have existed since the 12th century.
Al-Samawal al-Maghribi performed calculations with decimal numbers that essentially require long division, leading to infinite decimal results, but without formalizing the algorithm.
Caldrini is the earliest printed example of long division, known as the Danda method in medieval Italy, and it became more practical with the introduction of decimal notation for fractions by Pitiscus.
The specific algorithm in modern use was introduced by Henry Briggs 1600.

Education

Inexpensive calculators and computers have become the most common way to solve division problems, eliminating a traditional mathematical exercise and decreasing the educational opportunity to show how to do so by paper and pencil techniques. In North America, long division has been especially targeted for de-emphasis or even elimination from the school curriculum by reform mathematics, though it has been traditionally introduced in the 4th, 5th or even 6th grades.

Method

In English-speaking countries, long division does not use the division slash or division sign symbols but instead constructs a tableau. The divisor is separated from the dividend by a right parenthesis or vertical bar ; the dividend is separated from the quotient by a vinculum. The combination of these two symbols is sometimes known as a long division symbol, 'division bracket, or even a bus stop' It developed in the 18th century from an earlier single-line notation separating the dividend from the quotient by a left parenthesis.
The process is begun by dividing the left-most digit of the dividend by the divisor. The quotient becomes the first digit of the result, and the remainder is calculated. This remainder carries forward when the process is repeated on the following digit of the dividend. When all digits have been processed and no remainder is left, the process is complete.
An example is shown below, representing the division of 500 by 4.
125
4)500
4
10
8
20
20
0
A more detailed breakdown of the steps goes as follows:
  1. Find the shortest sequence of digits starting from the left end of the dividend, 500, that the divisor 4 goes into at least once. In this case, this is simply the first digit, 5. The largest number that the divisor 4 can be multiplied by without exceeding 5 is 1, so the digit 1 is put above the 5 to start constructing the quotient.
  2. Next, the 1 is multiplied by the divisor 4, to obtain the largest whole number that is a multiple of the divisor 4 without exceeding the 5. This 4 is then placed under and subtracted from the 5 to get the remainder, 1, which is placed under the 4 under the 5.
  3. Afterwards, the first as-yet unused digit in the dividend, in this case the first digit 0 after the 5, is copied directly underneath itself and next to the remainder 1, to form the number 10.
  4. At this point the process is repeated enough times to reach a stopping point: The largest number by which the divisor 4 can be multiplied without exceeding 10 is 2, so 2 is written above as the second leftmost quotient digit. This 2 is then multiplied by the divisor 4 to get 8, which is the largest multiple of 4 that does not exceed 10; so 8 is written below 10, and the subtraction 10 minus 8 is performed to get the remainder 2, which is placed below the 8.
  5. The next digit of the dividend is copied directly below itself and next to the remainder 2 to form 20. Then the largest number by which the divisor 4 can be multiplied without exceeding 20, which is 5, is placed above as the third leftmost quotient digit. This 5 is multiplied by the divisor 4 to get 20, which is written below and subtracted from the existing 20 to yield the remainder 0, which is then written below the second 20.
  6. At this point, since there are no more digits to bring down from the dividend and the last subtraction result was 0, we can be assured that the process finished.
If the last remainder when we ran out of dividend digits had been something other than 0, there would have been two possible courses of action:
  1. We could just stop there and say that the dividend divided by the divisor is the quotient written at the top with the remainder written at the bottom, and write the answer as the quotient followed by a fraction that is the remainder divided by the divisor.
  2. We could extend the dividend by writing it as, say, 500.000... and continue the process, in order to get a decimal answer, as in the following example.
31.75
4)127.00
12
07
4
3.0
2.8
20
20
0
In this example, the decimal part of the result is calculated by continuing the process beyond the units digit, "bringing down" zeros as being the decimal part of the dividend.
This example also illustrates that, at the beginning of the process, a step that produces a zero can be omitted. Since the first digit 1 is less than the divisor 4, the first step is instead performed on the first two digits 12. Similarly, if the divisor were 13, one would perform the first step on 127 rather than 12 or 1.

Basic procedure for long division of

  1. Find the location of all decimal points in the dividend and divisor.
  2. If necessary, simplify the long division problem by moving the decimals of the divisor and dividend by the same number of decimal places, to the right, so that the decimal of the divisor is to the right of the last digit.
  3. When doing long division, keep the numbers lined up straight from top to bottom under the tableau.
  4. After each step, be sure the remainder for that step is less than the divisor. If it is not, there are three possible problems: the multiplication is wrong, the subtraction is wrong, or a greater quotient is needed.
  5. In the end, the remainder,, is added to the growing quotient as a fraction,.

    Invariant property and correctness

The basic presentation of the steps of the process
focus on the what steps are to be performed,
rather than the properties of those steps that ensure the result will be correct
.
A slight variation of presentation requires more writing,
and requires that we change, rather than just update, digits of the quotient,
but can shed more light on why these steps actually produce the right answer
by allowing evaluation of q × m + r at intermediate points in the process.
This illustrates the key property used in the derivation of the algorithm
.
Specifically, we amend the above basic procedure so that
we fill the space after the digits of the quotient under construction with 0's, to at least the 1's place,
and include those 0's in the numbers we write below the division bracket.
This lets us maintain an invariant relation at every step:
q × m + r = n, where q is the partially-constructed quotient
and r the partially-constructed remainder.
Note that, initially q=0 and r=n, so this property holds initially;
the process reduces r and increases q with each step,
eventually stopping when r if we seek the answer in quotient + integer remainder form.
Revisiting the 500 ÷ 4 example above, we find
125
4)500
400
100
80
20
20
0

Example with multi-digit divisor

A divisor of any number of digits can be used. In this example, 1260257 is to be divided by 37. First the problem is set up as follows:

37)1260257
Digits of the number 1260257 are taken until a number greater than or equal to 37 occurs. So 1 and 12 are less than 37, but 126 is greater. Next, the greatest multiple of 37 less than or equal to 126 is computed. So 3 × 37 = 111 < 126, but 4 × 37 > 126. The multiple 111 is written underneath the 126 and the 3 is written on the top where the solution will appear:
3
37)1260257
111
Note carefully which place-value column these digits are written into. The 3 in the quotient goes in the same column as the 6 in the dividend 1260257, which is the same column as the last digit of 111.
The 111 is then subtracted from the line above, ignoring all digits to the right:
3
37)1260257
111
15
Now the digit from the next smaller place value of the dividend is copied down and appended to the result 15:
3
37)1260257
111
150
The process repeats: the greatest multiple of 37 less than or equal to 150 is subtracted. This is 148 = 4 × 37, so a 4 is added to the top as the next quotient digit. Then the result of the subtraction is extended by another digit taken from the dividend:
34
37)1260257
111
150
148
22
The greatest multiple of 37 less than or equal to 22 is 0 × 37 = 0. Subtracting 0 from 22 gives 22, we often don't write the subtraction step. Instead, we simply take another digit from the dividend:
340
37)1260257
111
150
148
225
The process is repeated until 37 divides the last line exactly:
34061
37)1260257
111
150
148
225
222
37