15.2% Comsume the recommended amount of calcium.
(4,4).........................
Answer:
Dividing exponents you subtract.
3^8/3^5 = 3^3
3^3
Multiplying exponents when an exponent is raised to another.
(3^3)^3 = <u>3^9</u>
<h2>
Final Answer is 
</h2><h2 />
Apparently this makes no sense according to comments, if you want a more indepth look into exponents search "The properties of exponents".
Factors of 35: 1, 5, 7, 35
Of those, only 5 and 7 are prime.
7>5
Final answer: 7
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;
}
