# Long division

In arithmetic, long division is a standard division algorithm suitable for dividing multi-digit numbers 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.[1] 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. Chunking (also known as the partial quotients method or the hangman method) is a less mechanical form of long division prominent in the UK which contributes to a more holistic understanding about the division process.[2]

While related algorithms have existed since the 12th century AD,[3] the specific algorithm in modern use was introduced by Henry Briggs c. 1600 AD.[4]

## Place in 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. (Internally, those devices use one of a variety of division algorithms, the faster ones of which relies on approximations and multiplications to achieve the tasks). In the United States, long division has been especially targeted for de-emphasis, or even elimination from the school curriculum, by reform mathematics, though traditionally introduced in the 4th or 5th grades.[5]

## Method

In English-speaking countries, long division does not use the division slash⟩ or division sign ⟨÷⟩ symbols but instead constructs a tableau.[6] The divisor is separated from the dividend by a right parenthesis)⟩ or vertical bar|⟩; the dividend is separated from the quotient by a vinculum (i.e., an overbar). The combination of these two symbols is sometimes known as a long division symbol or division bracket.[7] It developed in the 18th century from an earlier single-line notation separating the dividend from the quotient by a left parenthesis.[8][9]

The process is begun by dividing the left-most digit of the dividend by the divisor. The quotient (rounded down to an integer) becomes the first digit of the result, and the remainder is calculated (this step is notated as a subtraction). This remainder carries forward when the process is repeated on the following digit of the dividend (notated as 'bringing down' the next digit to the remainder). 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 (with a result of 125).

     125      (Explanations)
4)500
4        ( 4 ×  1 =  4)
10       ( 5 -  4 =  1)
8       ( 4 ×  2 =  8)
20      (10 -  8 =  2)
20      ( 4 ×  5 = 20)
0      (20 - 20 =  0)


An example of long division performed without a calculator.

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 (4 in this case). 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 (the last 0 in 500) 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 (using a decimal point in the quotient directly above the decimal point in the dividend), in order to get a decimal answer, as in the following example.
      31.75
4)127.00
12         (12 ÷ 4 = 3)
07        (0 remainder, bring down next figure)
4        (7 ÷ 4 = 1 r 3)
3.0      (bring down 0 and the decimal point)
2.8      (7 × 4 = 28, 30 ÷ 4 = 7 r 2)
20     (an additional zero is brought down)
20     (5 × 4 = 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 n ÷ m

1. Find the location of all decimal points in the dividend n and divisor m.
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 (or to the left), 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, r, is added to the growing quotient as a fractionr/m.

### Example with multi-digit divisor

Animated example of multi-digit long division

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 (ten-thousands place) 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


### Mixed mode long division

For non-decimal currencies (such as the British £sd system before 1971) and measures (such as avoirdupois) mixed mode division must be used. Consider dividing 50 miles 600 yards into 37 pieces:

          mi -     yd -   ft -   in
1 -    634      1      9 r. 15"
37)   50 -    600 -    0 -    0
37    22880     66    348
13    23480     66    348
1760    222       37    333
22880     128      29     15
=====     111     348     ==
170    ===
148
22
66
==


Each of the four columns is worked in turn. Starting with the miles: 50/37 = 1 remainder 13. No further division is possible, so perform a long multiplication by 1,760 to convert miles to yards, the result is 22,880 yards. Carry this to the top of the yards column and add it to the 600 yards in the dividend giving 23,480. Long division of 23,480 / 37 now proceeds as normal yielding 634 with remainder 22. The remainder is multiplied by 3 to get feet and carried up to the feet column. Long division of the feet gives 1 remainder 29 which is then multiplied by twelve to get 348 inches. Long division continues with the final remainder of 15 inches being shown on the result line.

### Interpretation of decimal results

When the quotient is not an integer and the division process is extended beyond the decimal point, one of two things can happen:

1. The process can terminate, which means that a remainder of 0 is reached; or
2. A remainder could be reached that is identical to a previous remainder that occurred after the decimal points were written. In the latter case, continuing the process would be pointless, because from that point onward the same sequence of digits would appear in the quotient over and over. So a bar is drawn over the repeating sequence to indicate that it repeats forever (i.e., every rational number is either a terminating or repeating decimal).

## Notation in non-English-speaking countries

China, Japan, Korea use the same notation as English-speaking nations including India. Elsewhere, the same general principles are used, but the figures are often arranged differently.

### Latin America

In Latin America (except Argentina, Bolivia, Mexico, Colombia, Paraguay, Venezuela, Uruguay and Brazil), the calculation is almost exactly the same, but is written down differently as shown below with the same two examples used above. Usually the quotient is written under a bar drawn under the divisor. A long vertical line is sometimes drawn to the right of the calculations.

     500 ÷ 4 =  125   (Explanations)
4                ( 4 ×  1 =  4)
10               ( 5 -  4 =  1)
8               ( 4 ×  2 =  8)
20              (10 -  8 =  2)
20              ( 4 ×  5 = 20)
0              (20 - 20 =  0)


and

     127 ÷ 4 = 31.75
124
30      (bring down 0; decimal to quotient)
28      (7 × 4 = 28)
20     (5 × 4 = 20)
0


In Mexico, the English-speaking world notation is used, except that only the result of the subtraction is annotated and the calculation is done mentally, as shown below:

     125     (Explanations)
4)500
10      ( 5 -  4 = 1)
20     (10 -  8 = 2)
0     (20 - 20 = 0)


In Bolivia, Brazil, Paraguay, Venezuela, Quebec, Colombia, and Peru, the European notation (see below) is used, except that the quotient is not separated by a vertical line, as shown below:

    127|4
−124 31,75
30
−28
20
−20
0


Same procedure applies in Mexico, Uruguay and Argentina, only the result of the subtraction is annotated and the calculation is done mentally.

### Eurasia

In Spain, Italy, France, Portugal, Lithuania, Romania, Turkey, Greece, Belgium, Belarus, Ukraine, and Russia, the divisor is to the right of the dividend, and separated by a vertical bar. The division also occurs in the column, but the quotient (result) is written below the divider, and separated by the horizontal line. The same method is used in Iran and Mongolia.

    127|4
−124|31,75
30
−28
20
−20
0


In Cyprus, as well as in France, a long vertical bar separates the dividend and subsequent subtractions from the quotient and divisor, as in the example below of 6359 divided by 17, which is 374 with a remainder of 1.

 6 3 5 9 17 − 5 1 374 1 2 5 − 1 1 9 6 9 − 6 8 1

Decimal numbers are not divided directly, the dividend and divisor are multiplied by a power of ten so that the division involves two whole numbers. Therefore, if one were dividing 12,7 by 0,4 (commas being used instead of decimal points), the dividend and divisor would first be changed to 127 and 4, and then the division would proceed as above.

In Austria, Germany and Switzerland, the notational form of a normal equation is used. <dividend> : <divisor> = <quotient>, with the colon ":" denoting a binary infix symbol for the division operator (analogous to "/" or "÷"). In these regions the decimal separator is written as a comma. (cf. first section of Latin American countries above, where it's done virtually the same way):

    127 : 4 = 31,75
−12
07
−4
30
−28
20
−20
0


The same notation is adopted in Denmark, Norway, Bulgaria, North Macedonia, Poland, Croatia, Slovenia, Hungary, Czech Republic, Slovakia, Vietnam and in Serbia.

In the Netherlands, the following notation is used:

   12 / 135 \ 11,25
12
15
12
30
24
60
60
0


## Algorithm for arbitrary base

Every natural number ${\displaystyle n}$  can be uniquely represented in an arbitrary number base ${\displaystyle b>1}$  as a sequence of digits ${\displaystyle n=\alpha _{0}\alpha _{1}\alpha _{2}...\alpha _{k-1}}$  where ${\displaystyle 0\leq \alpha _{i}  for all ${\displaystyle 0\leq i , where ${\displaystyle k}$  is the number of digits in ${\displaystyle n}$ . The value of ${\displaystyle n}$  in terms of its digits and the base is

${\displaystyle n=\sum _{i=0}^{k-1}\alpha _{i}b^{k-i-1}}$

Let ${\displaystyle n}$  be the dividend and ${\displaystyle m}$  be the divisor, where ${\displaystyle l}$  is the number of digits in ${\displaystyle m}$ . If ${\displaystyle k , then ${\displaystyle q=0}$  and ${\displaystyle r=n}$ . Otherwise, we iterate from ${\displaystyle 0\leq i\leq k-l}$ , before stopping.

For each iteration ${\displaystyle i}$ , let ${\displaystyle q_{i}}$  be the quotient extracted so far, ${\displaystyle d_{i}}$  be the intermediate dividend, ${\displaystyle r_{i}}$  be the intermediate remainder, ${\displaystyle \alpha _{i}}$  be the next digit of the original dividend, and ${\displaystyle \beta _{i}}$  be the next digit of the quotient. By definition of digits in base ${\displaystyle b}$ , ${\displaystyle 0\leq \beta _{i} . By definition of remainder, ${\displaystyle 0\leq r_{i} . All values are natural numbers. We initiate

${\displaystyle q_{-1}=0}$
${\displaystyle r_{-1}=\sum _{i=0}^{l-2}\alpha _{i}b^{k-i-1}}$

the first ${\displaystyle l-1}$  digits of ${\displaystyle n}$ .

With every iteration, the three equations are true:

${\displaystyle d_{i}=br_{i-1}+\alpha _{i+l-1}}$
${\displaystyle r_{i}=d_{i}-m\beta _{i}=br_{i-1}+\alpha _{i+l-1}-m\beta _{i}}$
${\displaystyle q_{i}=bq_{i-1}+\beta _{i}}$

There only exists one such ${\displaystyle \beta _{i}}$  such that ${\displaystyle 0\leq r_{i} .

Proof of existence and uniqueness of ${\displaystyle \beta _{i}}$  —

According to the definition of the remainder ${\displaystyle r_{i}}$ ,

${\displaystyle 0\leq r_{i}
${\displaystyle 0\leq br_{i-1}+\alpha _{i+l-1}-m\beta _{i}
${\displaystyle m\beta _{i}\leq br_{i-1}+\alpha _{i+l-1}

For the left side of the inequality, we select the largest ${\displaystyle \beta _{i}}$  such that

${\displaystyle m\beta _{i}\leq br_{i-1}+\alpha _{i+l-1}}$

There is always a largest such ${\displaystyle \beta _{i}}$ , because ${\displaystyle 0\leq \beta _{i}  and if ${\displaystyle \beta _{i}=0}$ , then

${\displaystyle 0\leq br_{i-1}+\alpha _{i+l-1}}$

but because ${\displaystyle b>1}$ , ${\displaystyle r_{i-1}\geq 0}$ , ${\displaystyle \alpha _{i+l-1}\geq 0}$ , this is always true. For the right side of the inequality we assume there exists a smallest ${\displaystyle \beta _{i}^{\prime }}$  such that

${\displaystyle br_{i-1}+\alpha _{i+l-1}

Since this is the smallest ${\displaystyle \beta _{i}^{\prime }}$  that the inequality holds true, this must mean that for ${\displaystyle \beta _{i}^{\prime }-1}$

${\displaystyle br_{i-1}+\alpha _{i+l-1}\geq m\beta _{i}^{\prime }}$

which is exactly the same as the left side of the inequality. Thus, ${\displaystyle \beta _{i}=\beta _{i}^{\prime }}$ . As ${\displaystyle \beta _{i}}$  will always exist, so will ${\displaystyle \beta _{i}^{\prime }}$  equal to ${\displaystyle \beta _{i}}$ , and there is only one unique ${\displaystyle \beta _{i}}$  that is valid for the inequality. Thus we have proven the existence and uniqueness of ${\displaystyle \beta _{i}}$ .

The final quotient is ${\displaystyle q=q_{k-l}}$  and the final remainder is ${\displaystyle r=r_{k-l}}$

### Examples

In base 10, using the example above with ${\displaystyle n=1260257}$  and ${\displaystyle m=37}$ , the initial values ${\displaystyle q_{-1}=0}$  and ${\displaystyle r_{-1}=1}$ .

${\displaystyle 0\leq i\leq k-l}$  ${\displaystyle \alpha _{i+l-1}}$  ${\displaystyle d_{i}=br_{i-1}+\alpha _{i+l-1}}$  ${\displaystyle \beta _{i}}$  ${\displaystyle r_{i}=d_{i}-m\beta _{i}}$  ${\displaystyle q_{i}=bq_{i-1}+\beta _{i}}$
0 2 ${\displaystyle 10\cdot 1+2=12}$  0 ${\displaystyle 12-37\cdot 0=12}$  ${\displaystyle 10\cdot 0+0=0}$
1 6 ${\displaystyle 10\cdot 12+6=126}$  3 ${\displaystyle 126-37\cdot 3=15}$  ${\displaystyle 10\cdot 0+3=3}$
2 0 ${\displaystyle 10\cdot 15+0=150}$  4 ${\displaystyle 150-37\cdot 4=2}$  ${\displaystyle 10\cdot 3+4=34}$
3 2 ${\displaystyle 10\cdot 2+2=22}$  0 ${\displaystyle 22-37\cdot 0=22}$  ${\displaystyle 10\cdot 34+0=340}$
4 5 ${\displaystyle 10\cdot 22+5=225}$  6 ${\displaystyle 225-37\cdot 6=3}$  ${\displaystyle 10\cdot 340+6=3406}$
5 7 ${\displaystyle 10\cdot 3+7=37}$  1 ${\displaystyle 37-37\cdot 1=0}$  ${\displaystyle 10\cdot 3406+1=34061}$

Thus, ${\displaystyle q=34061}$  and ${\displaystyle r=0}$ .

In base 16, with ${\displaystyle n={\text{f412df}}}$  and ${\displaystyle m=12}$ , the initial values are ${\displaystyle q_{-1}=0}$  and ${\displaystyle r_{-1}={\text{f}}}$ .

${\displaystyle 0\leq i\leq k-l}$  ${\displaystyle \alpha _{i+l-1}}$  ${\displaystyle d_{i}=br_{i-1}+\alpha _{i+l-1}}$  ${\displaystyle \beta _{i}}$  ${\displaystyle r_{i}=d_{i}-m\beta _{i}}$  ${\displaystyle q_{i}=bq_{i-1}+\beta _{i}}$
0 4 ${\displaystyle 10\cdot {\text{f}}+4={\text{f4}}}$  ${\displaystyle {\text{d}}}$  ${\displaystyle {\text{f4}}-12\cdot {\text{d}}={\text{a}}}$  ${\displaystyle 10\cdot 0+{\text{d}}={\text{d}}}$
1 1 ${\displaystyle 10\cdot {\text{a}}+1={\text{a1}}}$  8 ${\displaystyle {\text{a1}}-12\cdot 8=11}$  ${\displaystyle 10\cdot {\text{d}}+8={\text{d8}}}$
2 2 ${\displaystyle 10\cdot 11+2=112}$  ${\displaystyle {\text{f}}}$  ${\displaystyle 112-12\cdot {\text{f}}=4}$  ${\displaystyle 10\cdot {\text{d8}}+{\text{f}}={\text{d8f}}}$
3 ${\displaystyle {\text{d}}=13}$  ${\displaystyle 10\cdot 4+{\text{d}}={\text{4d}}}$  4 ${\displaystyle {\text{4d}}-12\cdot 4=5}$  ${\displaystyle 10\cdot {\text{d8f}}+4={\text{d8f4}}}$
4 ${\displaystyle {\text{f}}=15}$  ${\displaystyle 10\cdot 5+{\text{f}}={\text{5f}}}$  5 ${\displaystyle {\text{5f}}-12\cdot 5=5}$  ${\displaystyle 10\cdot {\text{d8f4}}+5={\text{d8f45}}}$

Thus, ${\displaystyle q={\text{d8f45}}}$  and ${\displaystyle r={\text{5}}}$ .

If one doesn't have the addition, subtraction, or multiplication tables for base b memorised, then this algorithm still works if the numbers are converted to decimal and at the end are converted back to base b. For example, with the above example,

${\displaystyle n={\text{f412df}}_{16}=15\cdot 16^{5}+4\cdot 16^{4}+1\cdot 16^{3}+2\cdot 16^{2}+13\cdot 16^{1}+15\cdot 16^{0}}$

and

${\displaystyle m={\text{12}}_{16}=1\cdot 16^{1}+2\cdot 16^{0}=18}$

with ${\displaystyle b=16}$ . The initial values are ${\displaystyle q_{-1}=0}$  and ${\displaystyle r_{-1}=15}$ .

${\displaystyle 0\leq i\leq k-l}$  ${\displaystyle \alpha _{i+l-1}}$  ${\displaystyle d_{i}=br_{i-1}+\alpha _{i+l-1}}$  ${\displaystyle \beta _{i}}$  ${\displaystyle r_{i}=d_{i}-m\beta _{i}}$  ${\displaystyle q_{i}=bq_{i-1}+\beta _{i}}$
0 4 ${\displaystyle 16\cdot 15+4=244}$  ${\displaystyle 13={\text{d}}}$  ${\displaystyle 244-18\cdot 13=10}$  ${\displaystyle 16\cdot 0+13=13}$
1 1 ${\displaystyle 16\cdot 10+1=161}$  8 ${\displaystyle 161-18\cdot 8=17}$  ${\displaystyle 16\cdot 13+8}$
2 2 ${\displaystyle 16\cdot 17+2=274}$  ${\displaystyle 15={\text{f}}}$  ${\displaystyle 274-18\cdot 15=4}$  ${\displaystyle 16\cdot (16\cdot 13+8)+15=16^{2}\cdot 13+16\cdot 8+15}$
3 ${\displaystyle {\text{d}}=13}$  ${\displaystyle 16\cdot 4+13=77}$  4 ${\displaystyle 77-18\cdot 4=5}$  ${\displaystyle 16\cdot (16^{2}\cdot 13+16\cdot 8+15)+4=16^{3}\cdot 13+16^{2}\cdot 8+16\cdot 15+4}$
4 ${\displaystyle {\text{f}}=15}$  ${\displaystyle 16\cdot 5+15=95}$  5 ${\displaystyle 95-18\cdot 5=5}$  ${\displaystyle 16\cdot (16^{3}\cdot 13+16^{2}\cdot 8+16\cdot 15+4=16^{4}\cdot 13+16^{3}\cdot 8+16^{2}\cdot 15+16^{1}\cdot 4+5}$

Thus, ${\displaystyle q=16^{4}\cdot 13+16^{3}\cdot 8+16^{2}\cdot 15+16^{1}\cdot 4+5={\text{d8f45}}_{16}}$  and ${\displaystyle r=5={\text{5}}_{16}}$ .

This algorithm can be done using the same kind of pencil-and-paper notations as shown in above sections.

          d8f45 r. 5
12 ) f412df
ea
a1
90
112
10e
4d
48
5f
5a
5


### Rational quotients

If the quotient is not constrained to be an integer, then the algorithm does not terminate for ${\displaystyle i>k-l}$ . Instead, if ${\displaystyle i>k-l}$  then ${\displaystyle \alpha _{i}=0}$  by definition. If the remainder ${\displaystyle r_{i}}$  is equal to zero at any iteration, then the quotient is a ${\displaystyle b}$ -adic fraction, and is represented as a finite decimal expansion in base ${\displaystyle b}$  positional notation. Otherwise, it is still a rational number but not a ${\displaystyle b}$ -adic rational, and is instead represented as an infinite repeating decimal expansion in base ${\displaystyle b}$  positional notation.

### Binary division

Calculation within the binary number system is simpler, because each digit in the course can only be 1 or 0 - no multiplication is needed as multiplication by either either results in the same number or zero.

If this were on a computer, multiplication by 10 can be represented by a bit shift of 1 to the left, and finding ${\displaystyle \beta _{i}}$  reduces down to the logical operation ${\displaystyle d_{i}\geq m}$ , where true = 1 and false = 0. With every iteration ${\displaystyle 0\leq i\leq k-l}$ , the following operations are done:

{\displaystyle {\begin{aligned}\alpha _{i+l-1}\ &{\mathtt {=}}\ n\ {\mathtt {\&}}\ (1\ {\mathtt {<<}}\ (k+1-i-l))\\d_{i}\ &{\mathtt {=}}\ r_{i-1}\ {\mathtt {<<}}\ 1+\alpha _{i+l-1}\\\beta _{i}\ &{\mathtt {=}}\ {\mathtt {!}}(d_{i}

For example, with ${\displaystyle n=10111001}$  and ${\displaystyle m=1101}$ , the initial values are ${\displaystyle q_{-1}=0}$  and ${\displaystyle r_{-1}=101}$ .

${\displaystyle 0\leq i\leq k-l}$  ${\displaystyle \alpha _{i+l-1}\ {\mathtt {=}}\ n\ {\mathtt {\&}}\ (1\ {\mathtt {<<}}\ (k+1-i-l))}$  ${\displaystyle d_{i}\ {\mathtt {=}}\ r_{i-1}\ {\mathtt {<<}}\ 1+\alpha _{i+l-1}}$  ${\displaystyle \beta _{i}\ {\mathtt {=}}\ !(d_{i}  ${\displaystyle r_{i}\ {\mathtt {=}}\ d_{i}-m\ {\mathtt {\&}}\ \beta _{i}}$  ${\displaystyle q_{i}\ {\mathtt {=}}\ q_{i-1}\ {\mathtt {<<}}\ 1+\beta _{i}}$
0 1 1011 0 1011 − 0 = 1011 0
1 1 10111 1 10111 − 1101 = 1010 1
10 0 10100 1 10100 − 1101 = 111 11
11 0 1110 1 1110 − 1101 = 1 111
100 1 11 0 11 − 0 = 11 1110

Thus, ${\displaystyle q=1110}$  and ${\displaystyle r=11}$ .

### Performance

On each iteration, the most time-consuming task is to select ${\displaystyle \beta _{i}}$ . We know that there are ${\displaystyle b}$  possible values, so we can find ${\displaystyle \beta _{i}}$  using ${\displaystyle O(\log(b))}$  comparisons. Each comparison will require evaluating ${\displaystyle d_{i}-m\beta _{i}}$ . Let ${\displaystyle k}$  be the number of digits in the dividend ${\displaystyle n}$  and ${\displaystyle l}$  be the number of digits in the divisor ${\displaystyle m}$ . The number of digits in ${\displaystyle d_{i}\leq l+1}$ . The multiplication of ${\displaystyle m\beta _{i}}$  is therefore ${\displaystyle O(l)}$ , and likewise the subtraction of ${\displaystyle d_{i}-m\beta _{i}}$ . Thus it takes ${\displaystyle O(l\log(b))}$  to select ${\displaystyle \beta _{i}}$ . The remainder of the algorithm are addition and the digit-shifting of ${\displaystyle q_{i}}$  and ${\displaystyle r_{i}}$  to the left one digit, and so takes time ${\displaystyle O(k)}$  and ${\displaystyle O(l)}$  in base ${\displaystyle b}$ , so each iteration takes ${\displaystyle O(l\log(b)+k+l)}$ , or just ${\displaystyle O(l\log(b)+k)}$ . For all ${\displaystyle k-l+1}$  digits, the algorithm takes time ${\displaystyle O((k-1)(l\log(b)+k))}$ , or ${\displaystyle O(kl\log(b)+k^{2})}$  in base ${\displaystyle b}$ .

## Generalizations

### Rational numbers

Long division of integers can easily be extended to include non-integer dividends, as long as they are rational. This is because every rational number has a recurring decimal expansion. The procedure can also be extended to include divisors which have a finite or terminating decimal expansion (i.e. decimal fractions). In this case the procedure involves multiplying the divisor and dividend by the appropriate power of ten so that the new divisor is an integer – taking advantage of the fact that a ÷ b = (ca) ÷ (cb) – and then proceeding as above.

### Polynomials

A generalised version of this method called polynomial long division is also used for dividing polynomials (sometimes using a shorthand version called synthetic division).

4. ^ "Henry Briggs - Oxford Reference". Cite journal requires |journal= (help)