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:
hopefully that this will help
Step-by-step explanation:
29 1/16 +15/16 = 30
Answer: #64, A. #67, A. #68, C
Step-by-step explanation:
#64
0.96/6= 0.16
2.4/16= 0.15
32= 0.18
16 oz is the least
#67
100/20=5
3*5=15
SO, it's 15%.
#68
Divide
$430/43= $10
$594/54= $11
Andrew= $8
So, Darren makes the most.
