Just like the sum, the product of numbers can be calculated using the decrease-and-conquer paradigm.
Suppose you want to calculate the product with the decrease-and-conquer paradigm. How many times will such an algorithm multiply any pair of numbers?