Identify and calculate the area and perimeter for each polygon

WILL GIVE BRAINLIEST ANSWER TO WHOEVER IS ABLE TO FULLY AND CORRECTLY ANSWER THIS QUESTION. Consider and trapezoid in the follow

FinnZ [79.3K]

This is an isosceles trapezoid, because the two angles are supplementary on the right side.

y is 25 based on the Pythagorean theorem

w is sqrt (850)=29.15

z must be 15

Making a right triangle to look at the altitude

cos 59=a/15, so a is 7.73 between the right corner and the edge of x

That means x is 29.15-2(7.73)=13.69

=============

The median should be half way between 13.69 and 29.15

That is half their sum, or half of 42.84 or 21.42

That doesn't change the answer above

Once I know the trapezoid is isosceles, the angles at the base have to be 59d and the angles at the top 121d.

please mark brainliest!

7 0

3 years ago

Please Help Will mark brainliest

bija089 [108]

The answer to your question is 0.83

4 0

2 years ago

Read 2 more answers

Use the Euclidean Algorithm to compute the greatest common divisors indicated. (a) gcd(20, 12) (b) gcd(100, 36) (c) gcd(207, 496

coldgirl [10]

Answer:

(a) $gcd(20, 12)=4$

(b) $gcd(100, 36)=4$

(c) $gcd(496,207 )=1$

Step-by-step explanation:

The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.

The Euclidean algorithm solves the problem:

Given integers $a, b$ , find $d=gcd(a,b)$

Here is an outline of the steps:

Let $a=x$ , $b=y$ .
Given $x, y$ , use the division algorithm to write $x=yq+r$ .
If $r=0$ , stop and output $y$ ; this is the gcd of $a, b$ .
If $r\neq 0$ , replace $(x,y)$ by $(y,r)$ . Go to step 2.

The division algorithm is an algorithm in which given 2 integers N and D, it computes their quotient Q and remainder R.

Let's say we have to divide N (dividend) by D (divisor). We will take the following steps:

Step 1: Subtract D from N repeatedly.

Step 2: The resulting number is known as the remainder R, and the number of times that D is subtracted is called the quotient Q.

(a) To find $gcd(20, 12)$ we apply the Euclidean algorithm:

$20 = 12\cdot 1 + 8\\ 12 = 8\cdot 1 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(20, 12)=4$ .

(b) To find $gcd(100, 36)$ we apply the Euclidean algorithm:

$100 = 36\cdot 2 + 28\\ 36 = 28\cdot1 + 8\\ 28 = 8\cdot 3 + 4\\ 8 = 4\cdot 2 + 0$

The process stops since we reached 0, and we obtain $gcd(100, 36)=4$ .

(c) To find $gcd(496,207 )$ we apply the Euclidean algorithm:

$496 = 207\cdot 2 + 82\\ 207 = 82\cdot 2 + 43\\ 82 = 43\cdot 1 + 39\\ 43 = 39\cdot 1 + 4\\ 39 = 4\cdot 9 + 3\\ 4 = 3\cdot 1 + 1\\ 3 = 1\cdot 3 + 0$

The process stops since we reached 0, and we obtain $gcd(496,207 )=1$ .

3 0

2 years ago

What is the quotient

mario62 [17]

Answer:

The quotient is 3x - 11 + 60/(x + 5) ⇒ 2nd answer

Step-by-step explanation:

* We will use the long division to solve the problem

- The dividend is 3x² + 4x + 5

- The divisor is x + 5

- The quotient is the answer of the division

- If the divisor not a factor of a dividend, the quotient has

a remainder

* Lets solve the problem

- At first divide the first term in the dividend by the first term in

the divisor

∵ 3x² ÷ x = 3x

- Multiply the divisor by 3x

∴ 3x (x + 5) = 3x² + 15x

-Subtract this expression from the dividend

∴ 3x² + 4x + 5 - (3x² + 15x) = 3x² + 4x + 5 - 3x² - 15x = -11x + 5

- Divide the first term -11x in the new dividend by the first

term x in the divisor

∴ -11x ÷ x = -11

- Multiply the divisor by -11

∴ -11(x + 5) = -11x - 55

-Subtract this expression from the new dividend

∴ -11x + 5 - (-11x - 55) = -11x + 5 + 11x + 55 = 60

∴ The quotient is 3x - 11 with remainder = 60

* The quotient is 3x - 11 + 60/(x + 5)

5 0

3 years ago

The inequality log8(2x) < log2(x – 2) can be graphed on the graphing calculator by using the inequalities log8(2x) < y and

denis-greek [22]

Answer:

c - (4, ∞)

Step-by-step explanation:

answer on edg

4 0

2 years ago