I hope this helped I don't really understand what you were asking but I solved the iniquity and plotted on a number line
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.
Answer:

Step-by-step explanation:

Answer:
<em><u>3. Last year, the numbers of calculators produced per day at a certain factory were normally distributed with a mean of 560 calculators and a standard deviation of 12 calculators.</u></em><em><u>(</u></em><em><u>C</u></em><em><u>)</u></em>
Step-by-step explanation:
<em><u>please click the heart and rate excellent and brainleist to </u></em><em><u>❤</u></em><em><u>☺️</u></em><em><u>☻</u></em><em><u>♨️</u></em><em><u>☻</u></em><em><u>☺️</u></em><em><u>❤</u></em>
Answer:
285
Step-by-step explanation:
9 = 7 + 2¹
13 = 9 + 2²
29 = 13 + 2⁴
285 = 29 + 2⁸