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 interest rate is B. 4%
Given:
Principal = 450
Interest = 126
term = 7
rate = ?
Simple Interest is computed by multiplying the Principal, rate, and term.
Interest = P × r × t
126 = 450 × r × 7
126 = 3150r
r = 126/3150
r = 0.04 x 100% = 4%
To check:
I = 450 × 0.04 x 7
I = 18 × 7
I = 126
Answer:
Step-by-step explanation:
The answer is 5.6 because 2+2+4+5+5+6+7+7+8+10=56
and 56/10=5.6
To find the mean<span>, add all the values together and divide by the number of values in the set. The result is your </span>mean<span>!
</span>Hope I helped:)
Answer:
r = correlation coefficient
Step-by-step explanation:
