Answer:
a diagram is necessary. please provide a diagram.
Answer:
1716 ways
Step-by-step explanation:
Given that :
Number of entrants = 13
The number of ways of attaining first, second and third position :
The number of ways of attaining first ; only 1 person can be first ;
Using permutation :
nPr = n! ÷(n-r)!
13P1 = 13! ÷ 12! = 13
Second position :
We have 12 entrants left :
nPr = n! ÷(n-r)!
12P1 = 12! ÷ 11! = 12
Third position :
We have 11 entrants left :
nPr = n! ÷(n-r)!
11P1 = 11! ÷ 10! = 11
Hence, Number of ways = (13 * 12 * 11) = 1716 ways
Answer:
C = 24.5 in
Step-by-step explanation:
Formula to find the circumference of a circle is :
C = 2πr
Here,
r ⇒ radius
So let us solve now.
C = 2πr
C = 2 × π × r
C = 2 × 3.14 × 3.9
C = 24.492 in
So, they've asked for nearest 10th.
Therefore, the answer will be 24.5 in.
Hope this helps you :-)
Let me know if you have any other questions :-)
Answer:
(a)
$24.10,
$18.20,
$15.25,
$9.35,
$0.50,
(b)
b=30-2.95g
Step-by-step explanation:
