Answer: It is an obtuse triangle I think beause more than one side is more than a 90 degree angle
Step-by-step explanation:
Answer:
Hoping someone else can answer with more confidence, but here's what I have:
on the left hand side:
upper is partial/penumbral lunar eclipse
lower is total solar eclipse
on the right hand side:
on the top: it's impossible for the moon to be behind the sun, so I'm not sure what they want there
middle is total solar eclipse
bottom is partial/penumbral lunar eclipse
Hope I helped at least a little
This is basically a simple problem to understand. The only thing that needs to be done is to divide the mass of the sun by the mass of mercury. It will give the required result.
Number of times the mass of sun is greater than
the mass of mercury = 21.3525×102921.3525×1029/<span>328.5×1021328.5×1021
= </span><span>7.1783629e+15
I hope that this is the answer that you were looking for and it has come to your great help.</span>
Answer:
53 54 55
Step-by-step explanation:
Consecutive Integers are integers that go one after the other unless explained otherwise, so 53, 54 and 55 add up to 162.
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;
}
