BINARY MULTIPLICATION ALGORITHM PROOF

Asked Feb 08 '20 at 15:53

Active Feb 08 '20 at 16:49

Viewed 34 times

So there is a multiplication trick It says 9×13 say Half and double everything 4.5×26 Cancel out the .5 4×26 2×52 1×104 Cancel out the even left hindsight multipliers and add the left right hand numbers

So 9×13= 104+13 = 117 I know how this can be explained by working in binary .Is there a rigorous proof how this algorithm works in binary.

edited Feb 08 '20 at 16:49

RobPratt

45,619

asked Feb 08 '20 at 15:53

Naman

1

Was your caps lock key stuck during the title? You have not explained the algorithm clearly. What is a left hindsight multiplier? It looks like you want some numbers above other ones. – Ross Millikan Feb 08 '20 at 15:56
The 'trick' is known as Russian peasant and/or ancient Egyptian multiplication method. – an4s Feb 08 '20 at 15:56
3

Does this answer your question? Proof of Russian Peasant Multiplication – an4s Feb 08 '20 at 15:57
Yes thank a lot – Naman Feb 09 '20 at 17:46

BINARY MULTIPLICATION ALGORITHM PROOF

0 Answers0