Answer:
number one. 186
number two. 36
Step-by-step explanation:
FOR NUMBER ONE:
the area of a trapezoid formula is
where a and b are the bases and h is the height. so we have to add in the numbers into the formula
= <em>81</em>
and the paralellogram formula is b×h. where b is the base and h is height
15 × 7 = <em>105</em>
so the area of the figure is 81 + 105 is 186 in^2
FOR NUMBER TWO:
the area of the square formula is
. where s is the side
4^2 = <em>16</em>
and for the paralellogram is b × h
4 × 5 = <em>20</em>
so the area of the figure is 16 +20 = 36 in^2
hope this helps! ;)
Answer:
46
Step-by-step explanation:
With those problems if you are not given a picture is good we draw one.
Because an angle bisector forms 2 congruent angles and because is given that < XVY ≅ < YVW then
m < XVY = m < YVW
2x+7 = x+15 , subtract x and 7 from both sides to isolate the like terms
2x-x = 15-7, combine like terms
x = 8
From the picture and the given we see that
m < XVW = m < XVY + m < YVW
m < XVW = 2x+7 + x+15 , combine like terms
m < XVW = 3x + 22, substitute x for 8
m < XVW = 3*8 + 22
m < XVW = 46
Check our work:
m < XVY = 2x+7 = 2*8 +7 = 16 +7 = 23
m < YVW = x+15 = 8 +15 = 23
m < XVW = m < XVY + m < YVW = 23+23 =46
NO. It's FALSE.

therefore 0.3801 > 0.3711
Answer:
"greatest common factor" (GCF) or "greatest common divisor" (GCD)
Step-by-step explanation:
Apparently, you're looking for the term that has the given definition. It is called the GCF or GCD, the "greatest common factor" or the "greatest common divisor."
_____
The GCF or GCD can be found a couple of ways. One way is to find the prime factors of the numbers involved, then identify the lowest power of each of the unique prime factors that are common to all numbers. The product of those numbers is the GCF.
<u>Example</u>:
GCF(6, 9)
can be found from the prime factors:
The unique factors are 2 and 3. Only the factor 3 is common to both numbers, and its lowest power is 1. Thus ...
GCF(6, 9) = 3¹ = 3
__
Another way to find the GCD is to use Euclid's Algorithm. At each step of the algorithm, the largest number modulo the smallest number is found. If that is not zero, the largest number is replaced by the result, and the process repeated. If the result is zero, the smallest number is the GCD.
GCD(6, 9) = 9 mod 6 = 3 . . . . . (6 mod 3 = 0, so 3 is the GCD)
The median of the stem-and-leaf plot is 23