Answer:
Number of Ways = ₄P₄ = 24
Step-by-step explanation:
Given that there are going to be 4 dignitaries, and that they are sensitive to the order (i.e the order of the dignitaries matter), hence the total number of ways they can be arranged can be found by permutating 4 dignitaries.
i.e
Number of Ways = ₄P₄ = 24
Answer:
Hi, there your answer will C. 85pi ft^2
Step-by-step explanation:
pi(5)(12)+pi(5)^2
60pi+25pi
85pi ft^2
Hope this helps :)
Answer:
1 / 2
Step-by-step explanation:
- First observe that the fate of the last person is determined the moment either the first or the last seat is selected! This is because the last person will either get the first seat or the last seat. Any other seat will necessarily be taken by the time the last guy gets to 'choose'.
- Since at each choice step, the first or last is equally probable to be taken, the last person will get either the first or last with equal probability: 1/2
- Armed with the key observation, we see that the event that the last person's correct seat is free, is exactly the same as the event that the first person's seat was taken before the last person's seat.
- Well, each person had to make a random choice, was equally likely to choose the first person's seat or the last person's seat - the random chooser exhibits absolutely no preference towards a particular seat. This means that the probability that one seat is taken before the other must be 1/2
<span>Changing the grouping of the addends should not change the sum, according to the associative property of addition. You might group them differently with (50 + 3) + 47, so that you have 50 + (3 + 47). You might not regroup them with (16 + 4) + 5 rather than 16 + (4 + 5).</span>
