If the two numbers each have N digits, that's N 2 (or N x N) multiplications altogether. In the example above, N is 3, and we had to do 3 2 = 9 multiplications.

Mathematicians have reportedly discovered a new way of multiplying two numbers together. The new technique is for really large numbers, and if it passes a peer-review, could be the fastest ...

It found an algorithm for multiplying two matrices of four rows of four numbers using just 47 multiplications, which outperforms Strassen’s 49 multiplications.

Indeed, when it comes to multiplying two numbers, the best (or fastest) way to do it is often far from obvious. One particularly intriguing and efficient multiplication algorithm was developed in ...

Sometimes you are given numbers expressed as a product of prime factors. For example, 8 = 2 3 and 90 = 2 × 3 2 × 5. If you want to find the LCM and HCF in an exam, we can use prime factor form ...