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:
thanks for the points i mean really. anways hope someone else can help
Answer:
5 out of 12
5/12
January, March, May, June, July
There are three months whose name starts with the letter 'j': January, June, July
There are two months whose name starts with the letter 'm': March, May
So altogether, there are 5 months whose name starts with the letter 'j' or 'm'. So the possible outcome is 5 and total number of sample space is 12.
Therefore the required probability is: 5/12
PLEASE GIVE BRAINLYEST :)
Answer:
2.777777 and -7/3
Step-by-step explanation:
2.7182818459 cannot be written in fraction form therefore it is irrational.
2.777777 is rational because it can be written as the fraction 25/9
The square root of 3 is 1.7320508075688772, this number cannot be written as a fraction so it is irrational.
-7/3 is rational because it is already in fraction form.
