• School Mathematics
• /
• v.13 no.2
• /
• pp.267-286
• /
• 2011

In this paper I investigated the historical developments of the algorithms for multiplication of natural numbers. Through this analysis I tried to describe more concretely what is to understand the common algorithm for multiplication of natural numbers. I found that decomposing dividends and divisors into small numbers and multiplying these numbers is the main strategy for carrying out multiplication of large numbers, and two decomposing and multiplying processes are very important in the algorithms for multiplication. Finally I proposed some implications based on these analysis.