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>
-2/3-(-1 1/3) =
-2/3 + 1 1/3 =
4/3 - 2/3 =
<em>2/3</em>
12 - (-5) =
12 + 5 =
<em>17</em>
-1 - (-6) =
-1 + 6 =
6 - 1 =
<em>5</em>
-3 3/8 - 7/8 =
27/8 - 7/8 =
20/8 =
2 4/8 =
<em>2</em><em> </em><em>1/2</em>
Answer:
Rational: all
Integers: 4, -36, -6
Step-by-step explanation:
A rational number is a number that can be written as a fraction of integers.
All numbers shown are rational numbers.
The integers are all positive and negative whole numbers and zero.
The integers are: 4, -36, -6
Hello. I could help you with this question because i'm actually learning that too. Just create another question showing the entire graph so that I could help you.