Added to Favorites

Popular Searches

Definitions

Ancient Egyptian multiplication 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. Also known as Egyptian multiplication and Peasant multiplication, it decomposes one of the multiplicands (generally the larger) into a sum of powers of two and creates a table of doublings of the second multiplicand. 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.## The decomposition

## The table

After the decomposition of the first multiplicand, it is necessary to 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. In the table, a line is obtained by multiplying the preceding line by two.## The result

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.## Example

Here, in actual figures, is how 238 is multiplied by 13. The lines are multiplied by two, from one to the next. A check mark is placed by the powers of two in the decomposition of 13.

## Peasant multiplication

Peasant multiplication, or Russian peasant multiplication uses an algorithm similar to Egyptian multiplication.

This technique is known in particular from the hieratic Moscow and Rhind Mathematical Papyri written in the seventeenth century B.C. by the scribe Ahmes.

The decomposition into a sum of powers of two was not intended as a change from base ten to base two; the Egyptians then were unaware of such concepts and had to resort to much simpler methods. The ancient Egyptians had laid out tables of a great number of powers of two so as not to be obliged to recalculate 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).

To find the largest power of 2 keep doubling your answer starting with number 1.

Example:

1 x 2 = 2

2 x 2 = 4

4 x 2 = 8

8 x 2 = 16

16 x 2 = 32

Example of the decomposition of the number 25:

- the largest power of two less than or equal to 25 is 16,
- 25 – 16 = 9,
- the largest power of two less than or equal to 9 is 8,
- 9 – 8 = 1,
- the largest power of two less than or equal to 1 is 1,
- 1 – 1 = 0

25 is thus the sum of the powers of two: 16, 8 and 1.

For example, if the largest power of two found during the decomposition is 16, and the second multiplicand is 7, the table is created as follows:

- 1; 7
- 2; 14
- 4; 28
- 8; 56
- 16; 112

The main advantage of this technique is that it makes use of only addition, subtraction, and multiplication by two.

✔ | 1 | 238 | |||||

2 | 476 | ||||||

✔ | 4 | 952 | |||||

✔ | 8 | 1904 | |||||

| |||||||

13 | 3094 |

Since 13 = 8 + 4 + 1, distribution of multiplication over addition gives 13 × 238 = (8 + 4 + 1) × 238 = 8 x 238 + 4 × 238 + 1 × 238 = 3094.

- Write the two numbers (A and B) you wish to multiply, each at the head of a column.
- Starting with A, divide by 2, flooring the quotient, until there is nothing left to divide. Write the series of results under A.
- Starting with B, keep doubling until you have doubled it as many times as you divided the first number. Write the series of results under B.
- Add up all the numbers in the B-column that are next to an odd number in the A-column. This gives you the result.

Example: 27 times 82

A-column B-column Add this 27 82 82 13 164 164 6 328 3 656 656 1 1312 1312 Result: 2214 The method works because multiplication is distributive, so:

$82\; times\; 27,$ $=\; 82\; times\; (1times\; 2^0\; +\; 1times\; 2^1\; +\; 0times\; 2^2\; +\; 1times\; 2^3\; +\; 1times\; 2^4,)$ $=\; 82\; times\; (1\; +\; 2\; +\; 8\; +\; 16),$ $=\; 82\; +\; 164\; +\; 656\; +\; 1312,$ $=\; 2214,.$ ## See also

## External links

- Russian Peasant Multiplication
- The Russian Peasant Algorithm (pdf file)
- Peasant Multiplication from cut-the-knot
- Egyptian Multiplication by Ken Caviness, The Wolfram Demonstrations Project.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Sunday September 14, 2008 at 01:34:41 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Sunday September 14, 2008 at 01:34:41 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.