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
iren [92.7K]
3 years ago
14

Bennett is setting up a light display for a wedding with two 10-foot strands of lights. The lights will be attached to the top o

f a pole and two stakes on the ground forming two right triangles. If the distance from the base of the pole to each stake is the same as the height of the pole, how tall, in feet, should the pole be? Round you answer to the nearest tenth.

Mathematics
1 answer:
Anuta_ua [19.1K]3 years ago
8 0

Answer:

7.1

Step-by-step explanation:

write pythagorean theorem x^{2} + x^{2} = 10^2

2x^2 = 100

divide 2 both side:

x^{2} = 50

\sqrt{x^2} = \sqrt{50}

x = \sqrt{50}

x = 7.07106781

round to nearest tenth:

x = 7.1

You might be interested in
lee is sewing vest using 16 green buttons and 56 blue buttons.All the vests are identical and all have both green and blue butto
DochEvi [55]
For all the answers I will assume that all buttons both green and blue must be used. 

For the first question we will start by searching all the divisors of 16;

16: 1, 2, 4, 8, 16
We will think about the numbers of green buttons that can be used as the divisors of 16. We will check if t<span>he dividend of 16 to its divisors is a divisor for 56.
</span>
1 => 16 vests with 1 green button 56/16 = 3.5
2=> 8 vests with 2 green buttons 56/8 = 7
4=>  4 vests with 4 green buttons 56/4 = 14
8=> 2 vests with 8 green buttons 56/2 = 28
16=> 1 vest with 16 green buttons 56/1 = 56

From all the above results we concluded that Lee can make:
8 vests with 2 green buttons and 7 blue buttons
4 vests with 4 green buttons and 14 blue buttons
2 vests with 8 green buttons and 28 blue buttons
1 vest with 16 green buttons and 56 blue buttons

For the second question, the <span>greatest number of vests represents the greatest common divider of 16 and 56. 
</span>First, we break into prime factors
16 = 2^4
56 = 2^3 *7
The greatest common divider is 8.
<span>Lee can make 8 vests and each one will have 2 green buttons and 7 blue buttons (16/8=2 and 56/8=7)</span>


3 0
3 years ago
What is the condition on the probability of success p that will guarantee the histogram of a binomial distribution is symmetrica
valentina_108 [34]

Answer:

The shape of a binomial distribution is symmetric when p = 0.5

Step-by-step explanation:

The attached graphic shows the symmetric binomial form.

6 0
3 years ago
Heh its me again I NEED HELPPPPPPPPP
kari74 [83]

Answer:

1st and 3rd and 5th

Step-by-step explanation:

5 0
3 years ago
I'm thinking of a number. It is either more than 19 or less than 13.
Nostrana [21]

Answer:

is this a trick question?

3 0
3 years ago
Find the<br> equation of the circle with center at (3, -2) and radius of 3.
kvasek [131]
(x-3) *squared* + (y + 2) *squared* = 6
4 0
3 years ago
Other questions:
  • What is the slope of the function
    12·2 answers
  • What is the sum of all positive 1 digit integers that 4221462 is divisible by?
    14·2 answers
  • The point (0, 2) is the only solution to the system of linear equations that contains the equations
    12·1 answer
  • Please I really need help on this!<br>​
    12·1 answer
  • Find the percent of the number.<br><br><br> 25% of 340
    6·1 answer
  • What is greater 39.13 or 41.
    12·2 answers
  • Andy is scuba diving. He starts at sea level and descends 10 feet in 2 1/2 minutes. If it continues this rate, where will Andy b
    12·1 answer
  • Chloe drives from her house to her Grandma's house 48 miles away in an hour and 12 minutes. How far could she travel in 9 minute
    9·2 answers
  • How is the product of 2 and 5 shown on a number line?
    13·1 answer
  • Please help me.<br><br><br><br><br> =======
    8·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!