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
Komok [63]
3 years ago
12

PLS HELP * 12 POINTS* I WILL MARK BRAINLIEST

Mathematics
1 answer:
tatyana61 [14]3 years ago
8 0

Answer:

1.45

2.61

3.33

4.108

5.98

6.82

7.52

8.142

9.36

10.64

Step-by-step explanation:

Use rule that a straight line is 180 and a right angle is 90

You might be interested in
An automobile engineer is revising a design for a conical chamber that was originally specified to be 12 inches long with a circ
icang [17]

The scale factor is 1.5, which means that the revised chamber is larger. The new dimensions are just the old dimensions times 1.5.

The volume of the revise chamber is:

V = (1/3) (PI) [(D/2)^2] (H)

= (1/3) (PI) {[(5.7)(1.5)/2]^2} [(12)(1.5)]

= 344.4874 in3

<span> </span>

4 0
4 years ago
Are these correct? ILL MARK YOU BRAINLIEST
Oxana [17]

Answer:

Yes

Step-by-step explanation:

1) Cos 300 = Cos (360 - 60) = Cos 60    {Cos 360 - theta = Cos theta}

                                              = 1/2

Sin 300 = Sin (360 - 60) = -Sin 60 = \frac{-\sqrt{3}}{2}

3) 3π/4 = 3*180/4 = 135

Cos 135 = Cos (90 + 45) = -Cos 45 = \frac{-\sqrt{2}}{2}

Sin 135 = Sin (90 + 45) = Sin 45 = \frac{\sqrt{2}}{2}

7 0
3 years ago
How do you solve (3/5)x + 1/4=(3/4)x-2/5 for x?​
nignag [31]
The answer is 4 1/3 because dhsjsjshhehdhdjdjddjjdjd
4 0
4 years ago
In 20 years Charles will be three times as old as he is now.Now how old is he?
Reil [10]

Answer:

The answer is 50

Step-by-step explanation:

20x3=50

6 0
3 years ago
What is the weight of the minimum spanning tree found using Kruskal's Algorithm for the graph above? ​
olchik [2.2K]

Answer:

  99

Step-by-step explanation:

Kruskal's Algorithm has you add edges in order increasing weight, skipping ones that create loops.

__

The order of increasing weights for this graph is ...

  10, 12, 14, 16, 18, 22, 24, 25, 28

The edges that can be added without creating loops are shown in bold.

The weight of the minimum spanning tree is ...

  10 +12 +14 +16 +22 +25 = 99

8 0
2 years ago
Other questions:
  • In a certain board game, a player rolls two fair six-sided dice until the player rolls doubles (where the value on each die is t
    9·2 answers
  • What is the value of the expression (146.33-57)
    11·1 answer
  • If (2−√3) is a root of a polynomial with integer coefficients, which of the following must be another root?
    5·1 answer
  • 6 points and brainliest answer
    14·2 answers
  • Help help help help help help help help
    15·1 answer
  • HELP PLEASE !!<br><br><br><br> Write an inequality that represents the graph.
    8·1 answer
  • Plz help with this word problem
    14·1 answer
  • A certain rectangle
    12·1 answer
  • Kelly is making a quilt out or "3 square yards of white fabric and 's square yards of yellow fabric. What is the unit rate of ye
    7·1 answer
  • Can someone please help on this question
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!