All categories

2 years ago

Solve for y. 108° 115° 130° 90°

Mathematics

2 answers:

olga nikolaevna [1]2 years ago

7 0

Answer:

y = 115

Step-by-step explanation:

5 angles should total to 540°.

135+112+88+90+y= 540

425+y=540

y = 115

katovenus [111]2 years ago

6 0

Answer: your answer is B. 115

Step-by-step explanation: I just took the test

You might be interested in

The angles of a triangle are described as follows: angle a is the largest angle; it measure is twice the measure of Angle b. The

nikklg [1K]

Answer:

Angle A = 102°

Angle B = 51°

Angle C = 27°

Step-by-step explanation:

angle A = 2b

angle B = b

angle C = 1/3 b + 10

Angle A + Angle B + Angle C = 180

2b + b + 1/3 b + 10 = 180

3 1/3 b + 10 = 180

10/3 b = 170

b = 51

a = 2b = 102

c = 1/3 b + 10 = 1/3 (51) + 10 = 17 + 10 = 27

4 0

3 years ago

What is quivalent to 5/8?

coldgirl [10]

Answer:

10/16 is also equivalent

7 0

2 years ago

Read 2 more answers

Answer the question and answer it down below

Sergio039 [100]

Answer:

4:24 p.m.

Step-by-step explanation:

Figure out how often the buses leave at the same time. This is the same as the least common multiple (LCM) of how often they leave the stadium.

The LCM is found by multiplying the maximum number of each prime factor found in any of the numbers.

The prime factors of a number are found by dividing it by whole numbers until the factors are all prime. Prime numbers only have the factors 1 and itself.

6 = 2 X 3

8 = 2 X 2 X 2

The greatest times 2 repeats is three times.

The greatest times 3 repeats is one time.

2 X 2 X 2 X 3 = 24

The LCM is 24, and the buses have the same leaving times every 24 minutes.

Find 24 minutes after 4:00 p.m. Change the minutes only, which are the numbers right of the colon : .

The buses will next leave together at 4:24 p.m.

5 0

3 years ago

A chef made 30 donuts in 60minutes how long would it take him to make 90donits

Oksanka [162]

30 donuts in 60 minutes
90 donuts ?

90 x 60 / 30 = 180 minutes

answer
180 minutes

5 0

3 years ago

Read 2 more answers

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