Gordon–Newell theorem

Fourier division or cross division is a pencil-and-paper method of division which helps to simplify the process when the divisor has more than two digits. It was invented by Joseph Fourier.

Method

The following exposition assumes that the numbers are broken into two-digit pieces, separated by commas: e.g. 3456 becomes 34,56. In general x,y denotes x·100 + y and x,y,z denotes x·10000 + y·100 + z, etc.

Suppose that we wish to divide c by a, to obtain the result b. (So a × b = c.)

${\frac {c}{a}}={\frac {c_{1},c_{2},c_{3},c_{4},c_{5}\dots }{a_{1},a_{2},a_{3},a_{4},a_{5}\dots }}=b_{1},b_{2},b_{3},b_{4},b_{5}\dots =b$

Note that a₁ may not have a leading zero; it should stand alone as a two-digit number.

We can find the successive terms b₁, b₂, etc., using the following formulae:

$b_{1}={\frac {c_{1},c_{2}}{a_{1}}}{\mbox{ with remainder }}r_{1}$

$b_{2}={\frac {r_{1},c_{3}-b_{1}\times a_{2}}{a_{1}}}{\mbox{ with remainder }}r_{2}$

$b_{3}={\frac {r_{2},c_{4}-b_{2}\times a_{2}-b_{1}\times a_{3}}{a_{1}}}{\mbox{ with remainder }}r_{3}$

$b_{4}={\frac {r_{3},c_{5}-b_{3}\times a_{2}-b_{2}\times a_{3}-b_{1}\times a_{4}}{a_{1}}}{\mbox{ with remainder }}r_{4}\dots$

Each time we add a term to the numerator until it has as many terms as a. From then on, the number of terms remains constant, so there is no increase in difficulty. Once we have as much precision as we need, we use an estimate to place the decimal point.

It will often be the case that one of the b terms will be negative. For example, 93,−12 denotes 9288, while −16,32 denotes −1600 + 32 or −1568. (Note: 45,−16,32 denotes 448432.) Care must be taken with the signs of the remainders also.

The general term is

$b_{i}={\frac {r_{i-1},c_{i+1}-\textstyle \sum _{j=2}^{i}b_{i-j+1}\times a_{j}}{a_{1}}}{\mbox{ with remainder }}r_{i}$

Partial quotients with more than two digits

In cases where one or more of the b terms has more than two digits, the final quotient value b cannot be constructed simply by concatenating the digit pairs. Instead, each term, starting with $b_{1},$ should be multiplied by 100, and the next term added (or, if negative, subtracted). This result should be multiplied by 100, and the next term added or subtracted, etc., until all terms are exhausted. In other words, we construct partial sums of the b terms:

$B_{1}=b_{1}$

$B_{i}=100b_{i-1}+b_{i}$

The last partial sum is the value for b.

Example

Find the reciprocal of π ≈ 3.14159.

${\frac {1}{\pi }}={\frac {10,00,00\dots }{31,41,59\dots }}=b_{1},b_{2},b_{3}\dots =b$

$b_{1}={\frac {10,00}{31}}=32{\mbox{ with remainder }}8$

$b_{2}={\frac {8,00-32\times 41}{31}}={\frac {-512}{31}}=-17{\mbox{ with remainder }}15$

$b_{3}={\frac {15,00+17\times 41-32\times 59}{31}}={\frac {309}{31}}=10{\mbox{ with remainder }}-1.$

The result is 32,-17,10 or 31,83,10 yielding 0.318310.

Bibliography

• Ronald W Doerfler. Dead Reckoning: Calculating without Instruments. Gulf Publishing, 1993.

External links

• Alternative Division Algorithms: Double Division