4 would be your answer lol
Answer:
Missing Number: 70,000,000
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;
}
Let's look at the formula to solve the perimeter.
2l+2w=98
We know that l=6w
Let's put that into the equation.
2(6w)+2w=98
12w+2w=98
14w=98
98÷14=7
So the width is 7. Let's find the length.
Since the length is six times the width: 7×6= 42
So, the length is 42 while the width is 7. We need to find the area.
42×7=294
The area is 294 m².
Tell me if this helps!!
Answer:
1 X 16 and 8 X2
Step-by-step explanation:
1 X 16 = 16
2 X 8 = 16
3 X nothing = 16
4 X 4 = 16
5 X nothing = 16
6 X nothing = 16
7 X nothing = 16
8 X 2 = 16
etc.
