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;
}
The nearest tenth of how fast a rover will hit Mars' surface after a bounce of 15 ft in height is 20.7ft/s.
<h3>What is the approximation about?</h3>
From the question:
Mars: F(x) = 2/3
Therefore, If x = 15
Then:
f (15) = 2/3 ![\sqrt[8]{15}](https://tex.z-dn.net/?f=%5Csqrt%5B8%5D%7B15%7D)
= 16/3
= 20.7ft/s
Hence, The nearest tenth of how fast a rover will hit Mars' surface after a bounce of 15 ft in height is 20.7ft/s.
Learn more about Estimation from
brainly.com/question/24592593
#SPJ1
The answer is going to be 890. hope that helped
Answer:
answer: increased 20%
Step-by-step explanation:
288 - 240 = 48
48/240 *100 = 20%
hope i helped :)