Answer:
The number of distinct arrangements is <em>12600</em><em>.</em>
Step-by-step explanation:
This is a permutation type of question and therefore the number of distinguishable permutations is:
n!/(n₁! n₂! n₃! ... nₓ!)
where
- n₁, n₂, n₃ ... is the number of arrangements for each object
- n is the number of objects
- nₓ is the number of arrangements for the last object
In this case
- n₁ is the identical copies of Hamlet
- n₂ is the identical copies of Macbeth
- n₃ is the identical copies of Romeo and Juliet
- nₓ = n₄ is the one copy of Midsummer's Night Dream
Therefore,
<em>Number of distinct arrangements = 10!/(4! × 3! × 2! × 1!)</em>
<em> = </em><em>12600 ways</em>
<em />
Thus, the number of distinct arrangements is <em>12600</em><em>.</em>
Answer:
No, he is not correct because red and yellow got the same amount of votes when it came to adding them up.
Step-by-step explanation:
Answer:
<h2>
88859.375 & f(n)= 28000(0.75)×</h2>
Step-by-step explanation:
using the information on the problem a function can can be made
f(n)= 28000(0.75)×
where x is the amount of years
plug in 4 for x in the equation to get
f(4)=8859.375
Answer:
I need points sry plz dont dellete
Step-by-step explanation:
