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;
}
0.03571428571428571428571428571429
The expression that is equivalent to 3t + 3t is 6t
Answer:
slope = 5/8
Step-by-step explanation:
y2 - y1 / x2 - x1
-7 - (-2) / -3 - 5
-5 / -8
= 5/8
y = x is a positively sloped line, meaning that it points to the right. It also has a y-intercept of (0,0).
y = -1/2x + 3 is a negatively sloped line, meaning that it points to the left. It has a y-intercept of (0,-3).
The correct graph is Graph A.
Hope this helps! :)