Answer:
13-gon
Step-by-step explanation:
The sum of the interior angles of a polygon with n sides is:
S = 180° (n − 2)
If S = 1980°, then:
1980° = 180° (n − 2)
11 = n − 2
n = 13
The least common denominator of 5/12 and -9/16
The answer is 48.
Now, we have to change the numerators also to make this a equal fraction to the first ones we had.
5*4 = 20
12*4 = 48
20/48
-9*3 = -27
16*3 = 48
-27/48
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;
}
If you double the width you make a similar prism with a scale factor of two, the surface area of the similar prism will increase as the square of the scale factor
Answer:
b=3a
Step-by-step explanation:
1/3b times 3 = b
a times 3 = 3a
