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:
the green line
Step-by-step explanation:
its closest to the point
Answer:
x = -8
Step-by-step explanation:
5(x - 1) = -45
5x - 5 = -45
add 5 to each side of the equation:
5x = -40
divide both sides by 5:
x = -8
Answer:
It all depends on the reduction, like by 2 it would shrink half the size or 3it would get smaller but not bt much. So all deoends
Step-by-step explanation:
