All you need to do is divide 161 by 7 and get 23 weeks
The GCF is what they all have in common.
2x is the only thing they ALL share.
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:
275
Step-by-step explanation:
Answer: 72
Step-by-step explanation:
L= 3W
area of a rectangle A= LxW
replace L with 3 W
A=3W*W= 3w^2
243=3W^2
243/3=W^2
81=w^2, and W=9
L=3*9=27
P= (L+W)=2(27+9)=72
