Answer:
43
Step-by-step explanation:
Using the remainder theorem, that is
The remainder on dividing f(x) by (x - h) is the value of f(h)
here division by (x - 3) hence evaluate f(3) for remainder
f(3) = 3² + 14(3) - 8 = 9 + 42 - 8 = 43 ← remainder
Answer:
a
Step-by-step explanation:
Answer: A
Step-by-step explanation: SORRY IF I GET IT WRONG
The answer is B. y = 0.75 + 2.25. because i've done this assement.
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;
}
