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
arsen [322]
2 years ago
11

PLEASE HELP!!!!

Mathematics
1 answer:
yarga [219]2 years ago
5 0

Answer:

87.4 in

Step-by-step explanation:

Imagine a right triangle with one side the hight the other side half of the base side and the hypotenuse the slant height and use Pythagorean Theorem.

h² + (23.4/2)² = 88.2² solve for hight,

h=√88.2²- (23.4/2)² is about 87.4 in

You might be interested in
When x = 1/2, what is the value of 8x-3/x?
sp2606 [1]

Answer:

Step-by-step explanation:

Putting value of x = 1/2 in the equation

8x - 3/x

8(1/2) - 3(1/2)

= 4 - 3/2

= 2.5 or 5/2

4 0
2 years ago
3^x-3^(x-2)=A*3^x <br><br> solve for A
ale4655 [162]

Answer:

a=\frac{8}{9}

Step-by-step explanation:

3^x-3x^{x-2} =a3^x

Divide both sides by 3^x:

3^{x-x}-3^{x-x-2}=a

Simplify:

3^0-3^{-2}=a\\a=1-\frac{1}{9} \\a=\frac{8}{9}

3 0
2 years ago
Write 24:14:6 in its simplest form.​
Iteru [2.4K]

Answer:

12 : 7 : 3

Step-by-step explanation:

24 : 14 : 6

12 : 7 : 3

Always start with smaller number to simplify it. Since 2 is the smaller number and it simplifies 24, 14, and 6 I start with it.

24 ÷ 2 = 12

14 ÷ 2 = 7

6 ÷ 2 = 3

We would stop here since it would not further simplify, therefore our answer is 12 : 7 : 3.

Hope this helps, thank you :) !!

3 0
2 years ago
Let G be a connnectde graph with n vertices and m edges. supposed also that m = n. prove that G contains exactly one cycle
ElenaW [278]

Answer:

Contradiction

Step-by-step explanation:

Suppose that G has more than one cycle and let C be one of the cycles of G, if we remove one of the edges of C from G, then by our supposition the new graph G' would have a cycle. However, the number of edges of G' is equal to m-1=n-1 and G' has the same vertices of G, which means that n is the number of vertices of G. Therefore, the number of edges of G' is equal to the number of vertices of G' minus 1, which tells us that G' is a tree (it has no cycles), and so we get a contradiction.

7 0
3 years ago
Someone please help me on number 30. Thank you
timurjin [86]

8.9-3.3j=-2.2j+2.3
add 3.3j to both sides
8.9=1.1j+2.3
subtract 2.3 from both sides
6.6=1.1j
divide both sides by 1.1
6=j
7 0
2 years ago
Other questions:
  • Need answer quick please! Thank you
    15·2 answers
  • 308559 to the nearest one thousand
    6·1 answer
  • Identify the terms and like terms in the expression
    13·1 answer
  • Which is greater 6.0 or 0.6
    11·2 answers
  • When Jeff played his new computer game for the first time, he scored 10,000 points. Each time he played, he increased his score
    9·1 answer
  • Which ordered pair is the best estimate for the solution of the
    15·1 answer
  • Please can someone help??????
    6·1 answer
  • What is the y-intercept of the equation: 3x+6y=42
    7·1 answer
  • Jenna lives 8 2/5 miles from work. Colby lives 3/4 of this distance from work. How far does Colby live from work?
    11·1 answer
  • A rectangle has a vertices E(-4,8),F(2,8),G(2,-2) and H(-4,-2). The rectangle is dilated with the origin as the center of dilate
    8·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!