摘要
The Vedic multiplication algorithm is a very fast way of oral calculation. However, the basis of the algorithm is not available so far. The present paper demystifies the general Vedic algorithm for multiplication by establishment of foundation of the Vedic algorithm of product finding through end results of conventional multiplication. This novel approach, i.e., finding algorithm from the end results of conventional calculations may be useful in devising algorithms similar to Vedic in cases of other calculations. Though the availability of cheap calculators made the Vedic Method obsolete, the present trend resurrected Vedic algorithms by their use in the design of computer processors for enhancing speed and performance.
The Vedic multiplication algorithm is a very fast way of oral calculation. However, the basis of the algorithm is not available so far. The present paper demystifies the general Vedic algorithm for multiplication by establishment of foundation of the Vedic algorithm of product finding through end results of conventional multiplication. This novel approach, i.e., finding algorithm from the end results of conventional calculations may be useful in devising algorithms similar to Vedic in cases of other calculations. Though the availability of cheap calculators made the Vedic Method obsolete, the present trend resurrected Vedic algorithms by their use in the design of computer processors for enhancing speed and performance.
