Answer:
32 005
Step-by-step explanation:
use this formula
Tn = a +(n-1)d
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>
-14??
Idek tbh it’s kinda hard
Answer:
option (b) df = 1, 24
Step-by-step explanation:
Data provided in the question:
levels of factor A, a = 2
levels of factor B, b = 3
Subjects in each Sample, s = 5
n = 5 × 3 × 2 = 30
Now
df for Factor A = a - 1
= 2 - 1
= 1
df for Factor B = b - 1
= 3 - 1
= 2
df for Interaction AB = ( a - 1 ) × ( b - 1 )
= 1 × 2
= 2
df for Total = n - 1
= 30 - 1
= 29
df for error = 29 - 5
= 24
Hence,
df values for the F-ratio evaluating the main effect of factor A is 1, 24
The correct answer is option (b) df = 1, 24