Answer:
The missing variable
Step-by-step explanation:
D=2
Answer:
-24
Step-by-step explanation:
Easy way: 42 - 18 = 24, then translate it to negative 24 because your numbers are negative.
A little bit harder way: -42 + (-18) or -42 + 18 = -24
Answer:
The radius of the circle is 12.006 m.
Step-by-step explanation:
Let us assume the radius of the circle = r
Circumference = 75.4 m
Now, CIRCUMFERENCE OF A CIRCLE = 2 π r
⇒ 75 .4 m = 2 π r
Now, putting π = 3.14, we get:
75 .4 m = 2 (3.14) r
⇒ 75.4 = 6. 28 r
or, r = 75.4/6.28 = 12.006
or, r = 12.006 m
Hence, the radius of the circle with circumference 75.4 m is 12.006 m.
Yes it is because 18÷6 is 3 and 6×3=18
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;
}
