The tens-digit of the multiplicand is 2, the multiplier is 3, and three times two is six.
12.
If the multiplicand does not have a hundreds-digit then if there is no carry digit then the multiplication algorithm has finished.
13.
This multiplicative inequality implies that the product of two polynomials is bounded from below by a quantity that depends on the multiplicand polynomials.
14.
As shown in the example, the multiplicand and multiplier are written above and to the right of a lattice, or a sieve.
15.
Since the multiplicand has no thousands-digit, then write this carry-digit in the thousands-column under the line ( not superscripted ):
16.
The number to be multiplied is called the " multiplicand ", while the number of times the multiplicand is to be multiplied comes from the " multiplier ".
17.
The number to be multiplied is called the " multiplicand ", while the number of times the multiplicand is to be multiplied comes from the " multiplier ".
18.
The tens-column so far contains only one digit : the tens-digit of the multiplicand ( though it might contain a carry digit under the line ).
19.
Similarly, multiplying by a number less than 1 can be imagined as squeezing towards 0 . ( Again, in such a way that 1 goes to the multiplicand .)
20.
On paper, write down in one column the numbers you get when you repeatedly halve the multiplier, ignoring the remainder; in a column beside it repeatedly double the multiplicand.
