Answer:
If the reindeer do not fight, there are 5!=120 ways to line them up in a straight line.
Out of these, Bloopin and Rudy are together in 4!=24 times. Similarly Rudy and Bloopin will be together 4!=24 times. So the number of ways they are not together is 120-24-24=72 ways.
Hope this helps. :)
Step-by-step explanation:
Spanish:
Si los renos no luchan, hay 5! = 120 formas de alinearlos en línea recta.
De estos, Bloopin y Rudy están juntos en 4! = 24 veces. De manera similar, Rudy y Bloopin estarán juntos 4! = 24 veces. Entonces, el número de formas en que no están juntas es 120-24-24 = 72 formas.
Espero que esto ayude :)
Solve for c by simplifying both sides of the equation, then isolating the variable.
Exact form: c = -4/9, 2
Decimal form: c = -.4, 2
= 2025
When you are told to find the smallest length possible, you perform L.C.M(Least common multiples)
For this, you divide the given lengths using the numbers that divides all through.
I have added an image to this answer. Go through it for more explanation
Step-by-step explanation:
You need to find the total number of students the pie chart will represent:
17 + 35 + 38 = 90
So you know, 360° represents 90 people
You can then find out the angle for each person: 360 ÷ 90 = 4
Each person is 4°
a)
1. 17 people took French so you would do 4° × 17 = 68°
2. 35 people took German so you would do 4° × 35 = 140°
3. 38 people took Italian so you would do 4° × 38 = 152°
b)
17 out of 90 people chose french so the probability would be 17/90
