try that then times it by 12.1
Answer:
The factored form would be (8g + 7h)(2g - 5h)
Step-by-step explanation:
In order to find this, we need to use factors of 16g^2 in the front of the parenthesis. We also need to use factors of -35h^2 in the second side. Now we try these in the parenthesis and FOIL until we get an appropriate middle term.
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;
}
If you mean intersecting lines then...
