All categories

4 years ago

Anybody know this ?????

Mathematics

1 answer:

sammy [17]4 years ago

7 0

Answer:

The correct answer is option C

They are complementary angles

Step-by-step explanation:

From the figure we can see two angles <ABC and <LMN,

To find the correct option

From figure we get,

m<ABC = 20°° and m<LMN = 70°

m<ABC + m<LMN = 20 + 70 = 90°

Therefore <ABC and <LMN are complementary angles

The correct answer is option C

They are complementary angles

You might be interested in

Which number should you divide on each side of this equation in order to isolate g? 7g=75+d-12x

xz_007 [3.2K]

Divide both sides by 7

7 0

3 years ago

Find the 59th term of the arithmetic sequence 29,37,45,...

liberstina [14]

Answer:

13,456

Step-by-step explanation:

Tn= a+(n-1)d

a is the first term, n is the given number and d is the common difference. d is given by subtracting the first term from the second term or the second from the third. Therefore the the 59th term of the sequence 29, 37, 45 is,

Tn= 29+(59-1)8

=29(58)8

=13,456

4 0

3 years ago

Taylor purchased 9 pints of ice cream for a party. If each guest will be served exactly 1 2 2 1 pint of ice cream, how many gu

Neporo4naja [7]

Complete question :

Carly purchased 9 1/2 pints of ice cream for a party. If each guest will be served exactly 3/5 pint of ice cream, what is the greatest number of gusts that Carly can serve

Answer:

15 guests

Step-by-step explanation:

Given that:

Total pints of icecream = 9 1/2

Fraction of ice cream pints per guest = 3/5 pints

Number of guest that can be served :

Total pints / fraction per guest

9 1/2 ÷ 3/5

19/2 * 5/3

95 / 6

= 15.8 guest

Hence, greatest Number of guest that can be served = 15

8 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

3 years ago

Lucy’s chocolate bar is 54% cocoa. If the weight of the chocolate bar is 54 grams, how many grams of cocoa does it contain? Roun

Masteriza [31]

Answer:

The chocolate bar contains 29.2 grams of cocoa.

Step-by-step explanation:

Given that Lucy’s chocolate bar is 54% cocoa and the weight of the chocolate bar is 54 grams.

Hence, the amount of cocoa in the chocolate bar is given by

54% of 54 grams

54% percentage means 54/100 = 0.54

Hence, the amount of cocoa in the chocolate bar is

$0.54\times54\\=29.16$

When rounded to the nearest tenth, 29.16 should be equal to 29.2

Hence, the chocolate bar contains 29.2 grams of cocoa.

4 0

3 years ago