Answer:
It is J
Step-by-step explanation: 19.5 times 7 is 136.5
Answer:
I personally have no idea how to do this but quizlet might have the answer
Sorry hope this helps though
Step-by-step explanation:
Answer:
9/10
Step-by-step explanation:
2 2/5 - 1 1/2
Get a common denominator of 10
2 2/5 *2/2 = 2 4/10
1 1/2 *5/5 = 1 5/10
2 4/10 - 1 5/10
Borrow from the 2 as 10/10
1 + 10/10 +4/10 - 1 5/10
1 14/10 - 1 5/10
9/10
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;
}
It should be 8473x 38473 93
