Russian Peasant Multiplication

The Russian Peasant Multiplication calculator turns a thousand-year-old folk-arithmetic trick into a guided animation. Instead of memorizing a times table, you only need three operations — halving the left number, doubling the right number, and adding the right values from rows whose left value is odd. This calculator builds the halving stair downward one row at a time, performs the parity check on each row, and reveals the binary digits of your left number as a bonus, so you finally see why the method works rather than just that it works.

How to Use the Russian Peasant Multiplication Calculator

1. Type the first whole number (the left value) — this is what gets halved each row.
2. Type the second whole number (the right value) — this is what gets doubled each row.
3. Click Calculate to build the halving stair, the parity column, and the binary reveal panel.
4. Press Play or Step → to animate. Rows appear from top to bottom; each row is marked Keep ✓ (odd) or Cross ✕ (even).
5. Watch the kept rows drop their right-column values into the running sum strip — the total is your product.

What Makes This Calculator Different

How the Russian Peasant Method Works

To compute \( a \times b \) by the Russian peasant method, write \( a \) and \( b \) at the top of two columns. Below the first row, halve the left value (use integer division, dropping any remainder) and double the right value. Repeat until the left column reaches 1. Now look at the left column row by row: for every row whose left value is odd, mark the matching right value as kept; for every row whose left value is even, cross the row out. Finally, add up all the kept right-column values. That sum equals \( a \times b \).

Why It Works — The Binary Connection

The halving column is binary right-shift in disguise. The remainder when dividing by 2 — that is, the parity of the current value — is the lowest binary bit of the value being halved. Reading those parities from the bottom row upward reconstructs the binary representation of \( a \). The doubling column is binary left-shift: it represents \( b \) multiplied by successively larger powers of 2. Adding the right values from odd-parity rows is therefore exactly \(\sum_{i} 2^i \cdot b\) over the set of bits where \( a \) has a 1 — which is just \( a \cdot b \) written out as a binary expansion.

Worked Example: 18 × 25

Start with the row (18, 25). 18 is even, so cross it out. Halve and double to get (9, 50); 9 is odd, so keep it. Halve and double again: (4, 100), even, crossed out. Then (2, 200), even, crossed out. Then (1, 400), odd, kept. The halving has reached 1, so we stop. Sum the kept right values: \( 50 + 400 = 450 \). Check: \( 18 \times 25 = 450 \). The parities from top to bottom were 0, 1, 0, 0, 1 — read bottom-up that is 10010₂, which is 18.

Why "Russian Peasant"? A Bit of History

The name was coined in nineteenth-century Western mathematical literature after travelers observed Russian peasants computing products this way for everyday trade and bookkeeping. The technique is far older: it appears in the Rhind Mathematical Papyrus from Egypt around 1550 BCE (where it is now called Egyptian multiplication) and survived in folk arithmetic across many cultures — sometimes called the Ethiopian peasant method or simply doubling and adding. The Russian peasant variant is distinguished by its halving direction: instead of doubling upward and then choosing which rows to keep, you halve downward and the parity decides the keep rule on the spot. Modern computers multiply integers using essentially the same shift-and-add algorithm, which is why the trick remains relevant today.

Russian Peasant vs Egyptian Multiplication

• Direction: Russian peasant builds the table downward by halving the left value; Egyptian multiplication builds upward by doubling powers of 2.
• Keep rule: Russian peasant uses a simple parity test (odd → keep); Egyptian multiplication requires knowing the binary expansion of the multiplier in advance.
• Mental load: Russian peasant needs only halving and parity checks; Egyptian needs you to choose which powers of 2 sum to the multiplier.
• Result: identical — both compute \( a \times b \) by adding the multiplicand multiplied by each set bit of the multiplier.

When This Method Beats the Standard Algorithm

• You only know how to halve, double, and add. No multiplication tables required.
• You want to demonstrate why binary representation matters. The parity column literally is the binary form of the left factor.
• You are teaching algorithms or computer architecture. Hardware shift-and-add multiplication is this method, mechanized.
• You enjoy historical mathematics. The same algorithm has been used for at least 3,500 years across Africa, Europe, and Asia.

Common Misconceptions This Visualizer Corrects

• "You have to memorize times tables." Not for this method — only halving, doubling, and adding.
• "Halving an odd number loses information." The lost half is recorded by the fact that this row got kept. The bookkeeping is exact.
• "Halving forever is slow." The stair has only about \( \log_2 a \) rows. For \( a = 1{,}000{,}000 \) that is just 20 rows.
• "It's a different algorithm from Egyptian multiplication." Same underlying math; different direction and different keep rule, but provably equivalent.

Frequently Asked Questions