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>
4n 5 + 3.5n 5 - 2.1n 5 = n 5 (4 + 3.5 - 2.1) = n 5 * 5.4 = 5.4n 5
Area of the board divided by the time
2 x 3 = 6ft^2
15/6= 2.5mins
Radius is half of the diameter so it's 7 for the diameter.
There are 9 two-year-olds and 18 each of 3 and 4 year olds.
To solve this we could write and solve the equation below, letting x be the number of 3 and 4 year olds.
x/2 + x + x = 45
x + 2x + 2x = 90
5x = 90
x = 18
From here, we just divide 18 by 2 to get the number of 2 year olds.