Answer:
x=88 (alternative angles)
y=31 each
v=41 (alternative angles)
w=20 (alternative angles)
Step-by-step explanation:
for y:
we add all the angles got therefore,
20+41+88+y+20+41+88+y=360(because total angle in a quadilateral is 360°)
298+2y=360
2y=360-298
2y=62
therefore y=62/2=31° for each y
Answer:
6
Step-by-step explanation:
2 halves make a whole so multiply 2 by 3. the answer is six. you can also add the halves. 1/2+1/2+1/2+1/2+1/2+1/2=3.
Answer:
answers
Step-by-step explanation:
A. Vertex at (−6, 1)
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;
}
A. y=2x
because slope-intercept form is y=mx+b. m= slope & b= y-int. The y-int is at the origin, so therefore y=0. The slope is 2, so therefore the answer is y=2x
