Ancient Egyptian multiplication

Last updated

In mathematics, ancient Egyptian multiplication (also known as Egyptian multiplication, Ethiopian multiplication, Russian multiplication, or peasant multiplication), one of two multiplication methods used by scribes, is a systematic method for multiplying two numbers that does not require the multiplication table, only the ability to multiply and divide by 2, and to add. It decomposes one of the multiplicands (preferably the smaller) into a set of numbers of powers of two and then creates a table of doublings of the second multiplicand by every value of the set which is summed up to give result of multiplication.

Contents

This method may be called mediation and duplation, where mediation means halving one number and duplation means doubling the other number. It is still used in some areas. [1]

The second Egyptian multiplication and division technique was known from the hieratic Moscow and Rhind Mathematical Papyri written in the seventeenth century B.C. by the scribe Ahmes. [2]

Although in ancient Egypt the concept of base 2 did not exist, the algorithm is essentially the same algorithm as long multiplication after the multiplier and multiplicand are converted to binary. The method as interpreted by conversion to binary is therefore still in wide use today as implemented by binary multiplier circuits in modern computer processors. [1]

Method

The ancient Egyptians had laid out tables of a great number of powers of two, rather than recalculating them each time. The decomposition of a number thus consists of finding the powers of two which make it up. The Egyptians knew empirically that a given power of two would only appear once in a number. For the decomposition, they proceeded methodically; they would initially find the largest power of two less than or equal to the number in question, subtract it out and repeat until nothing remained. (The Egyptians did not make use of the number zero in mathematics.)

After the decomposition of the first multiplicand, the person would construct a table of powers of two times the second multiplicand (generally the smaller) from one up to the largest power of two found during the decomposition.

The result is obtained by adding the numbers from the second column for which the corresponding power of two makes up part of the decomposition of the first multiplicand. [1]

Example

25 × 7 = ?

Decomposition of the number 25:

The largest power of two less than or equal to 25is 16:25 − 16= 9.
The largest power of two less than or equal to 9is 8:9 − 8= 1.
The largest power of two less than or equal to 1is 1:1 − 1= 0.
25 is thus the sum of: 16, 8 and 1.

The largest power of two is 16 and the second multiplicand is 7.

17
214
428
856
16112

As 25 = 16 + 8 + 1, the corresponding multiples of 7 are added to get 25 × 7 = 112 + 56 + 7 = 175.

Russian peasant multiplication

In the Russian peasant method, the powers of two in the decomposition of the multiplicand are found by writing it on the left and progressively halving the left column, discarding any remainder, until the value is 1 (or −1, in which case the eventual sum is negated), while doubling the right column as before. Lines with even numbers on the left column are struck out, and the remaining numbers on the right are added together. [3]

Example

238 × 13 = ?

13238
6  (remainder discarded)476
3952
1  (remainder discarded)1904
   
13238
6476
3952
1+1904

3094
  

See also

Related Research Articles

<span class="mw-page-title-main">Multiplication</span> Arithmetical operation

Multiplication is one of the four elementary mathematical operations of arithmetic, with the other ones being addition, subtraction, and division. The result of a multiplication operation is called a product.

A multiplication algorithm is an algorithm to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient than others. Numerous algorithms are known and there has been much research into the topic.

A binary number is a number expressed in the base-2 numeral system or binary numeral system, a method for representing numbers that uses only two symbols for the natural numbers: typically "0" (zero) and "1" (one). A binary number may also refer to a rational number that has a finite representation in the binary numeral system, that is, the quotient of an integer by a power of two.

<span class="mw-page-title-main">Egyptian fraction</span> Finite sum of distinct unit fractions

An Egyptian fraction is a finite sum of distinct unit fractions, such as That is, each fraction in the expression has a numerator equal to 1 and a denominator that is a positive integer, and all the denominators differ from each other. The value of an expression of this type is a positive rational number ; for instance the Egyptian fraction above sums to . Every positive rational number can be represented by an Egyptian fraction. Sums of this type, and similar sums also including and as summands, were used as a serious notation for rational numbers by the ancient Egyptians, and continued to be used by other civilizations into medieval times. In modern mathematical notation, Egyptian fractions have been superseded by vulgar fractions and decimal notation. However, Egyptian fractions continue to be an object of study in modern number theory and recreational mathematics, as well as in modern historical studies of ancient mathematics.

In mathematics, finite field arithmetic is arithmetic in a finite field contrary to arithmetic in a field with an infinite number of elements, like the field of rational numbers.

Ancient Egyptian mathematics is the mathematics that was developed and used in Ancient Egypt c. 3000 to c. 300 BCE, from the Old Kingdom of Egypt until roughly the beginning of Hellenistic Egypt. The ancient Egyptians utilized a numeral system for counting and solving written mathematical problems, often involving multiplication and fractions. Evidence for Egyptian mathematics is limited to a scarce amount of surviving sources written on papyrus. From these texts it is known that ancient Egyptians understood concepts of geometry, such as determining the surface area and volume of three-dimensional shapes useful for architectural engineering, and algebra, such as the false position method and quadratic equations.

Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. The algorithm was invented by Andrew Donald Booth in 1950 while doing research on crystallography at Birkbeck College in Bloomsbury, London. Booth's algorithm is of interest in the study of computer architecture.

<span class="mw-page-title-main">Moscow Mathematical Papyrus</span> Ancient Egyptian mathematical manuscript

The Moscow Mathematical Papyrus, also named the Golenishchev Mathematical Papyrus after its first non-Egyptian owner, Egyptologist Vladimir Golenishchev, is an ancient Egyptian mathematical papyrus containing several problems in arithmetic, geometry, and algebra. Golenishchev bought the papyrus in 1892 or 1893 in Thebes. It later entered the collection of the Pushkin State Museum of Fine Arts in Moscow, where it remains today.

The Egyptian Mathematical Leather Roll (EMLR) is a 10 × 17 in (25 × 43 cm) leather roll purchased by Alexander Henry Rhind in 1858. It was sent to the British Museum in 1864, along with the Rhind Mathematical Papyrus, but it was not chemically softened and unrolled until 1927 (Scott, Hall 1927).

The Reisner Papyri date to the reign of Senusret I, who was king of ancient Egypt in the 19th century BCE. The documents were discovered by G.A. Reisner during excavations in 1901–04 in Naga ed-Deir in southern Egypt. A total of four papyrus rolls were found in a wooden coffin in a tomb.

The Akhmim wooden tablets, also known as the Cairo wooden tablets are two wooden writing tablets from ancient Egypt, solving arithmetical problems. They each measure around 18 by 10 inches and are covered with plaster. The tablets are inscribed on both sides. The hieroglyphic inscriptions on the first tablet include a list of servants, which is followed by a mathematical text. The text is dated to year 38 of an otherwise unnamed king's reign. The general dating to the early Egyptian Middle Kingdom combined with the high regnal year suggests that the tablets may date to the reign of the 12th Dynasty pharaoh Senusret I, c. 1950 BC. The second tablet also lists several servants and contains further mathematical texts.

<span class="mw-page-title-main">Rhind Mathematical Papyrus</span> Ancient Egyptian mathematical document

The Rhind Mathematical Papyrus is one of the best known examples of ancient Egyptian mathematics.

<span class="mw-page-title-main">Alexander Henry Rhind</span> Scottish antiquarian and archaeologist

Alexander Henry Rhind was a Scottish antiquarian and archaeologist.

<span class="mw-page-title-main">Rod calculus</span> Calculating method used in ancient China

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 the Song dynasty and Yuan dynasty, culminating in the invention of polynomial equations of up to four unknowns in the work of Zhu Shijie.

The Rhind Mathematical Papyrus, an ancient Egyptian mathematical work, includes a mathematical table for converting rational numbers of the form 2/n into Egyptian fractions, the form the Egyptians used to write fractional numbers. The text describes the representation of 50 rational numbers. It was written during the Second Intermediate Period of Egypt by Ahmes, the first writer of mathematics whose name is known. Aspects of the document may have been copied from an unknown 1850 BCE text.

<span class="mw-page-title-main">Heqanakht Papyri</span> Piece of Ancient Egyptian literature

The Heqanakht Papyri or Heqanakht letters are a group of papyri dating to the early Middle Kingdom of Ancient Egypt that were found in the tomb complex of Vizier Ipi. Their find was located in the burial chamber of a servant named Meseh, which was to the right side of the courtyard of Ipi's burial complex. It is believed that the papyri were accidentally mixed into debris used to form a ramp to push the coffin of Meseh into the chamber. The papyri contain letters and accounts written by Heqanakht, a ka-priest of Ipi. Heqanakht himself was obliged to stay in the Theban area, and thus wrote letters to his family, probably located somewhere near the capital of Egypt at that time, near the Faiyum. These letters and accounts were somehow lost and thus preserved. The significance of the papers is that they give rare and valuable information about lives of ordinary members of the lower upper class of Egypt during this period.

The Lahun Mathematical Papyri is an ancient Egyptian mathematical text. It forms part of the Kahun Papyri, which was discovered at El-Lahun by Flinders Petrie during excavations of a workers' town near the pyramid of the Twelfth Dynasty pharaoh Sesostris II. The Kahun Papyri are a collection of texts including administrative texts, medical texts, veterinarian texts and six fragments devoted to mathematics.

In the history of mathematics, Egyptian algebra, as that term is used in this article, refers to algebra as it was developed and used in ancient Egypt. Ancient Egyptian mathematics as discussed here spans a time period ranging from c. 3000 BCE to c. 300 BCE.

<i>Mathematics in Ancient Egypt: A Contextual History</i>

Mathematics in Ancient Egypt: A Contextual History is a book on ancient Egyptian mathematics by Annette Imhausen. It was published by the Princeton University Press in 2016.

References

  1. 1 2 3 Neugebauer, Otto (1969) [1957]. The Exact Sciences in Antiquity (2 ed.). Dover Publications. ISBN   978-0-486-22332-2.
  2. Gunn, Battiscombe George. Review of The Rhind Mathematical Papyrus by T. E. Peet. The Journal of Egyptian Archaeology 12 London, (1926): 123–137.
  3. Cut the Knot - Peasant Multiplication

Other sources