I think the anwser is 17,887
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:
The length of the semicircle arc is 6π
Step-by-step explanation:
To solve this problem we need to use the circumferenc formula of a circle:
c = circumference
r = radius = 12
π = pi
c = π * d
we replace with the known values
c = π * 12
c = 12π
The length of the circumference is 12π
N
ow we divide the circumference by 2 and we will obtain the length of the arc of the semicircle
12π / 2 = 6π
The length of the semicircle arc is 6π
Answer:
Step-by-step explanation:
So this is multiplication
24.5 times 20 in dollars is $4.90 if we round it than it will be 5 dollars
Answer:
Step-by-step explanation:
× × ×
1 × 1 × 1 × 1 = 1
3 × 3 × 3 × 3 = 81
