Complex multiplication normally involves four multiplications and two additions. It involves one division, six multiplications and five subtractions only. This also involves one division, six multiplications and five subtractions only. In computational implementations this requires two quaternion multiplications. Therefore, Newton's iteration needs only two multiplications and one subtraction. In general, a degree-"n" polynomial can be evaluated using only +2 multiplications and "n" additions. Use of logarithms avoided laborious and error-prone paper-and-pencil multiplications and divisions. While producing the first logarithmic tables, Napier needed to perform many tedious multiplications. This involves fewer multiplications and is therefore computationally faster. The first part will consist of several multiplications involving one-digit multipliers. Problem 61 is concerned with multiplications of fractions. These algorithms need only a few multiplications and additions to calculate each vector. This format allows fast row access and matrix-vector multiplications (). The above figure uses capital pi notation to show a series of multiplications. The results of these multiplications correspond to a theoretical number.