Galley division

Last updated January 01, 2023

In arithmetic, the galley method, also known as the batello or the scratch method, was the most widely used method of division in use prior to 1600. The names galea and batello refer to a boat which the outline of the work was thought to resemble.

An earlier version of this method was used as early as 825 by Al-Khwarizmi. The galley method is thought to be of Arab origin and is most effective when used on a sand abacus. However, Lam Lay Yong's research pointed out that the galley method of division originated in the 1st century AD in ancient China.^[1]

The galley method writes fewer figures than long division, and results in interesting shapes and pictures as it expands both above and below the initial lines. It was the preferred method of division for seventeen centuries, far longer than long division's four centuries. Examples of the galley method appear in the 1702 British-American cyphering book written by Thomas Prust (or Priest).^[2]

How it works

Set up the problem by writing the dividend and then a bar. The quotient will be written after the bar. Steps:

(a1) Write the divisor below the dividend. Align the divisor so that its leftmost digit is directly below the dividend's leftmost digit (if the divisor is 594, for instance, it would be written an additional space to the right, so that the "5" would appear below the "6", as shown in the illustration).

(a2) Dividing 652 by 594 yields the quotient 1 which is written to the right of the bar.

Now multiply each digit of the divisor by the new digit of the quotient and subtract the result from the left-hand segment of the dividend. Where the subtrahend and the dividend segment differ, cross out the dividend digit and write if necessary the subtrahend digit and next vertical empty space. Cross out the divisor digit used.

(b) Compute 6 − 5×1 = 1. Cross out the 6 of the dividend and above it write a 1. Cross out the 5 of the divisor. The resulting dividend is now read off as the topmost un-crossed digits: 15284.

(c) Using the left-hand segment of the resulting dividend we get 15 − 9×1 = 6. Cross out the 1 and 5 and write 6 above. Cross out the 9. The resulting dividend is 6284.

(d) Compute 62 − 4×1 = 58. Cross out the 6 and 2 and write 5 and 8 above. Cross out the 4. The resulting dividend is 5884.

(e) Write the divisor one step to the right of where it was originally written using empty spaces below existing crossed out digits.

(f1) Dividing 588 by 594 yields 0 which is written as the new digit of the quotient.

(f2) As 0 times any digit of the divisor is 0, the dividend will remain unchanged. We therefore can cross out all the digits of the divisor.

(f3) We write the divisor again one space to the right

(omitted) Dividing 5884 by 594 yields 9 which is written as the new digit of the quotient. 58 − 5×9 = 13 so cross out the 5 and 8 and above them write 1 and 3. Cross out the 5 of the divisor. The resulting dividend is now 1384. 138 − 9×9 = 57. Cross out 1,3, and 8 of the dividend and write 5 and 7 above. Cross out the 9 of the divisor. The resulting dividend is 574. 574 − 4×9 = 538. Cross out the 7 and 4 of the dividend and write 3 and 8 above them. Cross out the 4 of the divisor. The resulting dividend is 538. The process is done, the quotient is 109 and the remainder is 538.

Other versions

The above is called the cross-out version and is the most common. An erasure version exists for situations where erasure is acceptable and there is not need to keep track of the intermediate steps. This is the method used with a sand abacus. Finally, there is a printers' method^{[ citation needed ]} that uses neither erasure or crossouts. Only the top digit in each column of the dividend is active with a zero used to denote an entirely inactive column.

65284/594 using galley division (erasure version)

Modern usage

Galley division was the favorite method of division with arithmeticians through the 18th century and it is thought that it fell out of use due to the lack of cancelled types in printing. It is still taught in the Moorish schools of North Africa and other parts of the Middle East.

Origin

Lam Lay Yong, mathematics professor of National University of Singapore, traced the origin of the galley method to the Sunzi Suanjing written about 400AD. The division described by Al-Khwarizmi in 825 was identical to the Sunzi algorithm for division.^[3]

Related Research Articles

Arithmetic is an elementary part of mathematics that consists of the study of the properties of the traditional operations on numbers—addition, subtraction, multiplication, division, exponentiation, and extraction of roots. In the 19th century, Italian mathematician Giuseppe Peano formalized arithmetic with his Peano axioms, which are highly important to the field of mathematical logic today.

Brainfuck is an esoteric programming language created in 1993 by Urban Müller.

<span class="mw-page-title-main">Division (mathematics)</span> Arithmetic operation

Division is one of the four basic operations of arithmetic, the ways that numbers are combined to make new numbers. The other operations are addition, subtraction, and multiplication.

<span class="mw-page-title-main">Subtraction</span> One of the four basic arithmetic operations

Subtraction is one of the four arithmetic operation along with addition, multiplication and division. Subtraction is an operation that represents removal of objects from a collection. For example, in the adjacent picture, there are 5 − 2 peaches—meaning 5 peaches with 2 taken away, resulting in a total of 3 peaches. Therefore, the difference of 5 and 2 is 3; that is, 5 − 2 = 3. While primarily associated with natural numbers in arithmetic, subtraction can also represent removing or decreasing physical and abstract quantities using different kinds of objects including negative numbers, fractions, irrational numbers, vectors, decimals, functions, and matrices.

A binary number is a number expressed in the base-2 numeral system or binary numeral system, a method of mathematical expression which uses only two symbols: typically "0" (zero) and "1" (one).

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.

In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalized version of the familiar arithmetic technique called long division. It can be done easily by hand, because it separates an otherwise complex division problem into smaller ones. Sometimes using a shorthand version called synthetic division is faster, with less writing and fewer calculations. Another abbreviated method is polynomial short division.

<span class="mw-page-title-main">Quotient</span> Mathematical result of division

In arithmetic, a quotient is a quantity produced by the division of two numbers. The quotient has widespread use throughout mathematics, and is commonly referred to as the integer part of a division, or as a fraction or a ratio. For example, when dividing 20 by 3, the quotient is "6 with a remainder of 2" in the Euclidean division sense, and $in the proper division sense. In the second sense, a quotient is simply the ratio of a dividend to its divisor.$

In mathematics and computing, the method of complements is a technique to encode a symmetric range of positive and negative integers in a way that they can use the same algorithm (hardware) for addition throughout the whole range. For a given number of places half of the possible representations of numbers encode the positive numbers, the other half represents their respective additive inverses. The pairs of mutually additive inverse numbers are called complements. Thus subtraction of any number is implemented by adding its complement. Changing the sign of any number is encoded by generating its complement, which can be done by a very simple and efficient algorithm. This method was commonly used in mechanical calculators and is still used in modern computers. The generalized concept of the radix complement is also valuable in number theory, such as in Midy's theorem.

In mathematics, the remainder is the amount "left over" after performing some computation. In arithmetic, the remainder is the integer "left over" after dividing one integer by another to produce an integer quotient. In algebra of polynomials, the remainder is the polynomial "left over" after dividing one polynomial by another. The modulo operation is the operation that produces such a remainder when given a dividend and divisor.

In arithmetic, Euclidean division – or division with remainder – is the process of dividing one integer by another, in a way that produces an integer quotient and a natural number remainder strictly smaller than the absolute value of the divisor. A fundamental property is that the quotient and the remainder exist and are unique, under some conditions. Because of this uniqueness, Euclidean division is often considered without referring to any method of computation, and without explicitly computing the quotient and the remainder. The methods of computation are called integer division algorithms, the best known of which being long division.

Location arithmetic is the additive (non-positional) binary numeral systems, which John Napier explored as a computation technique in his treatise Rabdology (1617), both symbolically and on a chessboard-like grid.

In computing, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another.

The operators in elementary arithmetic are addition, subtraction, multiplication, and division. The operators can be applied on both real numbers and imaginary numbers.

A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder, the result of Euclidean division. Some are applied by hand, while others are employed by digital circuit designs and software.

Rod calculus or rod calculation was the mechanical method of algorithmic computation with counting rods in China from the Warring States to Ming dynasty before the counting rods were increasingly replaced by the more convenient and faster abacus. Rod calculus played a key role in the development of Chinese mathematics to its height in Song Dynasty and Yuan Dynasty, culminating in the invention of polynomial equations of up to four unknowns in the work of Zhu Shijie.

In arithmetic, short division is a division algorithm which breaks down a division problem into a series of easier steps. It is an abbreviated form of long division — whereby the products are omitted and the partial remainders are notated as superscripts.

Genaille–Lucas rulers are an arithmetic tool invented by Henri Genaille, a French railway engineer, in 1891. The device is a variant of Napier's bones. By representing the carry graphically, the user can read off the results of simple multiplication problems directly, with no intermediate mental calculations.

Principles of Hindu Reckoning is a mathematics book written by the 10th- and 11th-century Persian mathematician Kushyar ibn Labban. It is the second-oldest book extant in Arabic about Hindu arithmetic using Hindu-Arabic numerals, preceded by Kibab al-Fusul fi al-Hisub al-Hindi by Abul al-Hassan Ahmad ibn Ibrahim al-Uglidis, written in 952.

Sunzi Suanjing was a mathematical treatise written during 3rd to 5th centuries AD which was listed as one of the Ten Computational Canons during the Tang dynasty. The specific identity of its author Sunzi is still unknown but he lived much later than his namesake Sun Tzu, author of The Art of War. From the textual evidence in the book, some scholars concluded that the work was completed during the Southern and Northern Dynasties. Besides describing arithmetic methods and investigating Diophantine equations, the treatise touches upon astronomy and attempts to develop a calendar.

References

↑ Lay-Yong, Lam (June 1966). "On the Chinese Origin of the Galley Method of Arithmetical Division". The British Journal for the History of Science. 3 (1): 66–69. doi:10.1017/s0007087400000200. S2CID 145407605 . Retrieved 2012-12-29.
↑ Nerida F. Ellerton and M. A. (Ken) Clements, Abraham Lincoln's Cyphering Book and Ten other Extraordinary Cyphering Books" (2014). This book shows examples, and Chapter 3 states "Thomas became a shopkeeper and the training he received when he was preparing his beautiful, largely abbaco-inspired, cyphering book would have been beneficial to him during his time as a shopkeeper. He used the galley algorithm when performing division calculations, and was determined to master the rule of three." See Figure 3.7 on page 23.
↑ Lam Lay Yong, The Development of Hindu-Arabic and Traditional Chinese Arithmetic, Chinese Science, 13 1996, 35–54

External links

Galley or Scratch Method of Division at The Math Forum

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Lay-Yong, Lam (June 1966). "On the Chinese Origin of the Galley Method of Arithmetical Division". The British Journal for the History of Science. 3 (1): 66–69. doi:10.1017/s0007087400000200. S2CID 145407605 . Retrieved 2012-12-29.

[2] Nerida F. Ellerton and M. A. (Ken) Clements, Abraham Lincoln's Cyphering Book and Ten other Extraordinary Cyphering Books" (2014). This book shows examples, and Chapter 3 states "Thomas became a shopkeeper and the training he received when he was preparing his beautiful, largely abbaco-inspired, cyphering book would have been beneficial to him during his time as a shopkeeper. He used the galley algorithm when performing division calculations, and was determined to master the rule of three." See Figure 3.7 on page 23.

[3] Lam Lay Yong, The Development of Hindu-Arabic and Traditional Chinese Arithmetic, Chinese Science, 13 1996, 35–54

[1]

[2]

[3]