I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression
f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k
If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is.
If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.
So here's the function
int product(int m, int k)
{
if (m == 0) return 0;
return product(m-1,k) + k;
}
Answer:
8.4
Step-by-step explanation:
Add 8+8+8+9+9=42 then 42/5 equals 8.4
Hope this helps! ;-)
Answer: 20 miles
Step-by-step explanation:
From the question, we are informed that Avis truck company charges $20 plus $2 per mile and that Budget truck company charges $3 per mile.
Let the number of miles that the charge will be the same for both companies be represented by x. This can then be used to form an equation as:
20 + 2x = (3 × x)
20 + 2x = 3x
3x - 2x = 20
x = 20
The charge will be thesame at 20 miles