1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
timofeeve [1]
2 years ago
14

Pls help hw came late and i dont want a detention

Mathematics
2 answers:
kogti [31]2 years ago
8 0

Answer:

A) 108

B) C virtical opisite angles

Step-by-step explanation:

Mrac [35]2 years ago
4 0

Answer:

180

Step-by-step explanation:

they are vertical angles

You might be interested in
Which of the following expressions would give you the greatest quotient (answer to the division problem)? PLEASEE ITS THE LAST Q
Alja [10]
Help me or my family and my friends are in my
6 0
2 years ago
Read 2 more answers
11/6358 long agurithum
miss Akunina [59]

Answer:

Least common multiple:

lcm (578; 11) = 6,358 = 2 × 11 × 172;

Numbers have no common prime factors: 6,358 = 578 × 11.

Step-by-step explanation:

Approach 1. Integer numbers prime factorization:

578 = 2 × 172;

11 is a prime number, it cannot be broken down to other prime factors;

Multiply all the prime factors, by the largest exponents.

Least common multiple:

lcm (578; 11) = 2 × 11 × 172;

lcm (578; 11) = 2 × 11 × 172 = 6,358

Numbers have no common prime factors: 6,358 = 578 × 11.

Integer numbers prime factorization

Approach 2. Euclid's algorithm:

Calculate the greatest (highest) common factor (divisor), gcf, hcf, gcd:

Step 1. Divide the larger number by the smaller one:

578 ÷ 11 = 52 + 6; Step 2. Divide the smaller number by the above operation's remainder:

11 ÷ 6 = 1 + 5; Step 3. Divide the remainder from the step 1 by the remainder from the step 2:

6 ÷ 5 = 1 + 1; Step 4. Divide the remainder from the step 2 by the remainder from the step 3:

5 ÷ 1 = 5 + 0; At this step, the remainder is zero, so we stop:

1 is the number we were looking for, the last remainder that is not zero.

This is the greatest common factor (divisor).

Least common multiple, formula:

lcm (a; b) = (a × b) / gcf, hcf, gcd (a; b);

lcm (578; 11) =

(578 × 11) / gcf, hcf, gcd (578; 11) =

6,358 / 1 =

6,358;

lcm (578; 11) = 6,358 = 2 × 11 × 172;

8 0
2 years ago
What’s 4d plus 12e in distributive property
jeka57 [31]
I am not 100% certain but i believe it goes as follows:

4 ( 1 + d ) + ( 3 + e)
4d + 12e
6 0
3 years ago
The base edge of a square pyramid is 30 cm. The pyramid is 6 cm tall. Find the volume of the pyramid
Eduardwww [97]

Answer:

5400 cm^3

Step-by-step explanation:

Volume = Base Area * H

Base area is the area of a square with one side = 30 cm

H = 6cm

Base Area = s^2

Base Area = 30^2 = 900

Volume  =  900 * 6

Volume = 5400 cm^3

4 0
3 years ago
Read 2 more answers
Evaluate the expression when z= -5 <br> 100 divided (-z2)
lilavasa [31]

Answer:the anwser is 4

Step-by-step explanation:

3 0
3 years ago
Read 2 more answers
Other questions:
  • G 32​% of adults say cashews are their favorite kind of nut. you randomly select 12 adults and ask each to name his or her favor
    8·1 answer
  • a rectangular field measures 10 yards by 24 yards. What is the distance, d, from one corner to the opposite corner?
    10·1 answer
  • Explain how you would convert a measurement given in ounces in pints
    11·1 answer
  • You have $40 to spend on n gallons of gas that costs $3.25 per gallon. ​
    11·1 answer
  • The histogram shows the distributions of essay scores for high school sophomores and juniors in a contest. Which comparison of t
    13·2 answers
  • 4x-y=3 is it linear or no
    5·2 answers
  • What is the coefficient of the term 12p+9q
    13·1 answer
  • What is the sum of the interior angles of a polygon that has 16 sides
    10·1 answer
  • 1. Name of the missing segment.<br> 2.Length of the missing segment.
    8·2 answers
  • A copy machine can print 480 copies every 4 minutes. How many copies can it print in 10 minutes? :)
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!