Answer:
don't know sorry babe
Step-by-step explanation:
Answer:
y = 6x - 4
Step-by-step explanation:
slope (m) is 6
y intercept (b) is -4
plug values into y = mx + b:
y = 6x - 4
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;
}
Answer:
Step-by-step explanation:
Given
Represent the volume of the cylinder with V1 and the volume of the sphere with V2
So, from the first statement: we have:
and
To solve for 
, we simply substitute 
for 
in
Hence, the volume of the sphere is 
