√2, √3, √5, √11, √21, π(Pi) are all irrational.
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:
0.8496
90(squared) + 90 (squared) = C (squared)
(we use 90 because the base path is 90 ft long since the diamond is a square that makes all sides 90 ft long)
8100 + 8100 = c(squared)
16200 = c(squared)
we will get the square root of 16200 to get the diagonal length
C=127.3 ft, and since it is the diagonal distance we will device it to 2, to get the distance from the pitcher ro the 2nd base.
127.3/2 = 67.7 ft.
67.7 ft is the distance from the pitcher<span> to the 2nd base.</span>
