5 ms·
And by the sum-of-odd-numbers theorem (sum of 2n-1 = n^2), you don't even need to multiply to generate that table.
by slongfield 6y ago
And by the sum-of-odd-numbers theorem (sum of 2n-1 = n^2), you don't even need to multiply to generate that table.
- 082349872349872 6y agosum of odd numbers, in shower tiles: https://en.wikipedia.org/wiki/Proof_without_words#/media/File:Proofwithoutwords.svg https://en.wikipedia.org/wiki/Proof_without_words#/media/Fil...
- RajuVarghese 6y agoTrue, that does remove the necessity of the table. However, I was checking how the Babylonians did it and the article that I read seems to indicate that they used base-60 tables. On a different note, does anyone know if this method has been exploited on CPUs without multiplication circuitry in the ALU?
- ogogmad 6y agoAccording to Wikipedia ([1]), Charles Putney implemented the quarter-square method for the 6502. [1] - https://en.wikipedia.org/wiki/Multiplication_algorithm#Quarter_square_multiplication https://en.wikipedia.org/wiki/Multiplication_algorithm#Quart...
- RajuVarghese 6y agoThanks for that pointer! Fascinating to see the multiplication method invented by the Babylonians being used on a microprocessor.