Answer:
answer is down
Step-by-step explanation:
4) S and Z
5) A line that goes vertical and then goes to the right
see this:
---------------
/
/
/
/
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: 2
Step-by-step explanation:
It is like you a=have 3 pencils and you give 1 to your friend how many will you have?
subtract 1 from 3
3-1=2
Answer:
C
Step-by-step explanation:
The general rule for the quadratic function is
Use the data from the table:
We get the system of three equations:
Subtract these equations:
From the first equation
Substitute it into the second equation:
So,
The quadratic function is
Y = 3x - 4
y = 3(-1) - 4
y = -3 - 4 = -7
Graph pair is (-1, -7)
y = 3(0) - 4
y = 0 - 4 = -4
Graph pair is (0, -4)
y = 3(2) - 4
y = 6 - 4 = 2
Graph pair is (2, 2)
y = 3(4) - 4
y = 12 - 4 = 8
Graph pair is (4, 8)
