All categories

3 years ago

Area of a trapezoid: 9 m by 15m by 20m

Mathematics

2 answers:

kvv77 [185]3 years ago

5 0

A=1/2 9+20×15
1/2. 29×15

217.5

exis [7]3 years ago

3 0

Equation:
$A = \frac{a + b}{2}h$

a (base) = 9
b (base) = 20
h (height) = 15

$A = \frac{9 + 20}{2}15$

$A = \frac{29}{2}15$

$A = 14.5 * 15$

$A = 217.5$

The area of the trapezoid is 217.5 m.

You might be interested in

What % of $30 is $21?

Black_prince [1.1K]

Answer:

Step-by-step explanation:

3 0

3 years ago

Read 2 more answers

If M is the midpoint of AB, find the coordinate of point B if the coordinate of point A are (7,10) and the midpoint, M is(6,1)

xeze [42]

Answer:

(5, - 18)

Step-by-step explanation:

IN MIDPOINT, WE SUM BOTH X VALUES AND Y VALUES AND DIVIDE BY TWO.

(x+7)/2=6. (y+20)/2=1

X+7=12. Y+20=2

X=12-7. Y=2-20

X=5. Y=-18

B=(5, - 18)

8 0

3 years ago

Removing which point from the coordinate plane would make the graph a function of X?

lisabon 2012 [21]

You would need to remove (-2, 1)

8 0

3 years ago

Ritz can eat 8 apples in 15 minutes. How long does it take Ritz to eat 16 apples at the same rate?

natka813 [3]

The rate Ritz can eat apples is 8/15 apples per minute.

Set the rate (which is measured apples / minutes) equal to 16 apples / t minutes.

(8/15) = (16/t)

Cross multiply.

16*15 = 8t

t = 20

The answer is 30 minutes. You could solve the problem with basic reasoning as well. 16 is twice the number of apples as 8, so the time it takes to eat them will be double 15 minutes.

5 0

3 years ago

5. The recursive algorithm given below can be used to compute gcd(a, b) where a and b are non-negative integer, not both zero.

s2008m [1.1K]

Implementating the given algorithm in python 3, the greatest common divisors of (124 and 244) and (4424 and 2111) are 4 and 1 respectively.

The program implementation is given below and the output of the sample run is attached.

def gcd(a, b):

#initialize a function named gcd which takes in two parameters

if a>b:

#checks if a is greater than b

return gcd (b, a)

#if true interchange the Parameters and Recall the function

elif a == 0:

return b

elif a == 1:

return 1

elif((a%2 == 0)and(b%2==0)):

#even numbers leave no remainder when divided by 2, checks if a and b are even

return 2 * gcd(a/2, b/2)

elif((a%2 !=0) and (b%2==0)):

#checks if a is odd and B is even

return gcd(a, b/2)

else :

return gcd(a, b-a)

#since it's a recursive function, it recalls the function with new parameters until a certain condition is satisfied

print(gcd(124, 244))

print()

#leaves a space after the first output

print(gcd(4424, 2111))

Learn more :brainly.com/question/25506437

6 0

2 years ago