Answer:
40320 different ways
Step-by-step explanation:
That problem is a permutation one
We have eight people to occupy one position in a team, without any constraint at all
So
Total number of events = P(8)
P (8) = 8!
P (8) = 8*7*6*5*4*3*2*1
P (8) = 40320 different ways
The correct answer is C because when using distributive property it simplifies back to 5b+30
Answer:
<h2>p = 5</h2>
Step-by-step explanation:

Answer:
i think it is c
Step-by-step explanation:
hop it helped
We have: PT = NT <=> 4x - 17 = x + 10 <=> 3x = 27 <=> x = 9
=> NT = 4x - 17 = 4.9 - 17 = 19
Δ RNT have:
![RT^2 = NT^2 -RN^2 =19^2 -14^2=165\\=>RT=\sqrt{165} [= 12.84523258]](https://tex.z-dn.net/?f=RT%5E2%20%3D%20NT%5E2%20-RN%5E2%20%3D19%5E2%20-14%5E2%3D165%5C%5C%3D%3ERT%3D%5Csqrt%7B165%7D%20%20%5B%3D%2012.84523258%5D)
Ok done. Thank to me :>