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:
Step-by-step explanation: 2= 41/7 3= 37/9 4= 62/7
Answer:
c)26 or positive and negative
First simplify the equation of parabola
in the following way:
.
You can see that if x=1 or x=2, then y=0. Two points of intersection with x-axis are (1,0) and (2,0).
A) 4*3 x 5*2
b) 9*4 x 7*2
c) 3 x 7*4
d) 2*2 x 9*4
8*5
