What is the perimeter of the trapezoid graphed below?

Mathematics

2 answers:

Karo-lina-s [1.5K]3 years ago

5 0

Each slanty side is sqrt(29).
So the perimeter is 8+2sqrt(29) .

Zanzabum3 years ago

3 0

To get the perimeter of the trapezoid, we will add the lengths of the 4 sides together.
So, first we will need to get the length of each side.

Base of trapezoid = 8 - 2 = 4 units
The upper edge of the trapezoid = 6 - 4 = 2 units

Now, for the two side edges, we can note that they are both equal. So, we need to get only one length (as the other would be the same). I will get the length of the left side.
Coordinates of the start point are (2,4) which represent (x1,y1)
Coordinates of the end point are (4,9) which represent (x2,y2)
To get the distance between the two points, we will use the rule attached in the image below as follows:
distance = sqrt ((4-2)^2+(9-4)^2)
distance = √29
Therefore, each of the side edges equal √29 units

From the above, we can now easily get the perimeter as follows:
perimeter = 6 + 2 + √29 + √29
perimeter = 8 + 2√29 units

Based on the above calculations, the best choice would be:
D. 8 + 2√29 units

You might be interested in

What is the sum of the given polynomials in standard form ? (X^2-3x)+(-2x^2+5x-3)

Greeley [361]

$(x^2-3x)+(-2x^2+5x-3)=x^2-3x-2x^2+5x-3\\\\=(x^2-2x^2)+(-3x+5x)-3=-x^2+2x-3$

3 0

3 years ago

Without using a division or multiplication operator and without using iteration , define a recursive method named product that a

Fantom [35]

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;
}

8 0

2 years ago

Special air bags are used to protect scientific equipment when a rover lands on the surface of Mars. On Earth, the function appr

PSYCHO15rus [73]

The nearest tenth of how fast a rover will hit Mars' surface after a bounce of 15 ft in height is 20.7ft/s.

<h3>What is the approximation about?</h3>

From the question:

Mars: F(x) = 2/3 $\sqrt{64x}$