Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

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.


True, 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?


According to Wikipedia ([1]), Charles Putney implemented the quarter-square method for the 6502.

[1] - https://en.wikipedia.org/wiki/Multiplication_algorithm#Quart...


Thanks for that pointer! Fascinating to see the multiplication method invented by the Babylonians being used on a microprocessor.





Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: