<span>3.60555128 is the awnser</span>
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:
16
Step-by-step explanation:
This question can be modeled using the equation 3x+4=52 (x is the purple marbles). To solve this equation subtract 4 from both sides, making it 3x=48. divide both by three showing x=16. This shows that 16 is the answer.
Answer:29
so the mini triangle in the corner is a mini model of the entire triangle, all you have to do is take the width or bottom number and find the factor in which it is smaller, then take the height of the smaller triangle and add the factor in which it increases to it. so the factor goes up by 31 1/2--9=22 1/2 and adding the factor in which it increases to the height is 22 1/2+6 1/2=29 because 2 halfs make a whole.
Step-by-step explanation:
mr clean has big brien 0-0
Answer:
5/8 ÷ 7/10 = 25/28
Uh i believe this is the lowest fraction it can go to
