Simple algorithms for finding squares of numbers in various bases
Nguyen‐Huu‐Bong · International Journal of Mathematical Education in Science and Technology · 1996
A simple method, Algorithm A, for calculating the square of any decimal number that ends in 5, is first described. The reason why the method works is also given. As a crude algorithm, and especially for numbers with more than 3 digits, it requires the well‐known Russian Peasant Algorithm as a subroutine. Finally, it is shown that Algorithm A, suitably modified, can also be used for finding squares of numbers in other bases.