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>
Step-by-step explanation:
what that no exsample
sorry bro
you have no exsample im so sorry
Check the picture attached.
Let OB be the radius of circle with center O.
Let B' be the image of B after the described rotation
OB and OB' are sides of the equilateral triangle OBB'.
The x coordinate of B' is the midpoint of OB, that is 5.
In the right triangle B', point (5, 0) and B:
Distance point (5, 0) to B is 5
|B'B|=|OB|=10
so by the pythagorean theorem:

units
Answer:
Since both equal y
x-1=y=2x+1
x-1=2x+1
minus x both sides
-1=x+1
minus 1 both sides
-2=x
value of x is -2