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
AfilCa [17]
2 years ago
6

Can someone plzzz help me with numbers 15 and 16 olzzz show work cuz I don’t understand plzz

Mathematics
1 answer:
sertanlavr [38]2 years ago
6 0
Pythagoras says
a squared = b squared + c squared so
xsquared= 21 squared +17 squared
x squared = 441 + 34
x squared = 475
x = squared root of 475
x= 21.79mi
You might be interested in
How do you solve this?
motikmotik
Pemdas helps so first you do Parentheses Exponet multiply divide add and subtract
3 0
2 years ago
Read 2 more answers
Emily flipped a coin 30 times the coin landed heads up nine times and tails up 21 times
lara [203]
Part A)
 The coin landed on heads 9 times out of 30 flips, so the experimental probability is 9/30, which reduces to 3/10 probability.

Part B)
 Theoretically a coin has a 1/2 probability of landing on heads each flip


8 0
3 years ago
(10 Points) Tanya is visiting New Orleans, and she wants to bring back T-shirts for all her friends. She’s
brilliants [131]
I’m on the way home I can see if I could have a good time at your house and I’ll
3 0
2 years ago
What is the value of x ; 32x + 53 = 501
kirill [66]
32x + 53 = 501 
       -53       - 53 

<u>32x</u> = <u>448</u>
32       32

x = 14 
6 0
3 years ago
Read 2 more answers
Question 31 pts Prove the statement is true using mathematical induction: 2n-1 ≤ n! Use the space below to write your answer. To
Sladkaya [172]

Answer:

P(3) is true since 2(3) - 1 = 5  < 3! = 6.  

Step-by-step explanation:

Let P(n) be the proposition that 2n-1 ≤ n!. for n ≥ 3

Basis: P(3) is true since 2(3) - 1 = 5  < 3! = 6.  

Inductive Step: Assume P(k) holds, i.e., 2k - 1 ≤ k! for an arbitrary integer k ≥ 3. To show that P(k + 1) holds:

2(k+1) - 1 = 2k + 2 - 1

≤ 2 + k! (by the inductive hypothesis)

= (k + 1)! Therefore,2n-1 ≤ n! holds, for every integer n ≥ 3.

4 0
2 years ago
Other questions:
  • On day 4 the 1rst 2 <br> thx
    6·2 answers
  • What is the quotient of 1984 ÷ 45​
    6·1 answer
  • Which scenario can be represented using the inequalities below? 1.25 &lt; x &lt; 1.5 a container of milk costs at least $1.25 bu
    6·2 answers
  • A mailbox on the street is 600 feet from the top of a building. From the mailbox looking up to the tops of that building and a s
    10·1 answer
  • The first five terms of a pattern are shown.
    15·1 answer
  • What is the solution to this equation?
    10·1 answer
  • One kind of plant has only blue flowers and white flowers. According to a genetic model, the offsprings of a certain cross have
    9·1 answer
  • WILL GIVE YOU BRAINLIST
    15·2 answers
  • Click on picture to see
    15·2 answers
  • I will Award Brainlist !! please Help its geometry ! :D
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!