Answer:
I’m pretty sure x=6
Step-by-step explanation:
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:
Greatest integral value of K = 3.
Step-by-step explanation:
The nature of the roots of a quadratic equation is determined by the sign of the discriminant, b^2 - 4ac. For non-real roots this is negative.
2x^2 - kx + 9 = 0
The discriminant = (-k)^2 - 4*2*2 , so:
k^2 - 16 < 0 for non-real roots.
k^2 < 16
k < √16
k < 4
So the answer is 3.
The greatest integral value is 8.
Answer:
Option D is correct.
Step-by-step explanation:
27.35 x 20/100
=> 2.735 x 2/1
=> $5.47
=> $5.50 (Rounded)
Therefore, Option D is correct.
Hoped this helped.
An exponential behavior can be observed.
Let x be the number of years she has to wait.
100((1+0.08/12)^12x) = 150
Now solve for x.
log base 1.08/12 of 1.5 = 61.02 approx
12x=61.02
x=5.09 years
