What he said for every four there is four
Answer:
k=2/3
Step-by-step explanation:
Step 1:
Step 1 in solving the exponential equations is re-writing the base same as other side of the equation
so,
Step 2:
Second step is equating the exponents
The rule used is:
So in this case
So the solution is:
k=2/3 ..
Step-by-step explanation:
no of days = (15×12)/20= 9 days
I hope this helps
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;
}
