The garden has four quarters. three quarters are planted with basil. one quarter is planted with sage. The strips represent quarters. So that means that three strips represent three quarters. Well one strip represents one quarter.
The answer to your question is (2,-6)
Answer:
Prime factorization: 50 = 2 x 5 x 5
Answer:
I'm pretty sure it's 16
Step-by-step explanation:
it measures up with the other triangles side
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;
}
