We are given the following information about sets A and B:
We need to find the value of the combination \( ^{n(A)}C_{n(B)} \).
Step 1: Find n(A) and n(B).
We know that \( n(A \times B) = n(A) \times n(B) \). So, we have:
\[ n(A) \times n(B) = 35 \]
We need to find pairs of integers (\( n(A), n(B) \)) such that their product is 35, and both integers are greater than 1 (from condition 1). The factors of 35 are 1, 5, 7, 35.
The possible pairs of factors greater than 1 whose product is 35 are (5, 7) and (7, 5).
Now, we use condition 3: \( n(B) < n(A) \).
Therefore, the only possibility is \( n(A) = 7 \) and \( n(B) = 5 \).
Step 2: Calculate \( ^{n(A)}C_{n(B)} \).
We need to calculate \( ^{7}C_{5} \).
Using the formula for combinations: \( ^nC_r = \frac{n!}{r!(n-r)!} \)
\[ ^{7}C_{5} = \frac{7!}{5!(7-5)!} \]
\[ ^{7}C_{5} = \frac{7!}{5!2!} \]
\[ ^{7}C_{5} = \frac{7 \times 6 \times 5!}{5! \times (2 \times 1)} \]
Cancel out \( 5! \):
\[ ^{7}C_{5} = \frac{7 \times 6}{2 \times 1} \]
\[ ^{7}C_{5} = \frac{42}{2} \]
\[ ^{7}C_{5} = 21 \]
Thus, \( ^{n(A)}C_{n(B)} = 21 \).
Comparing this result with the given options:
The correct option is 21.
We are given two sets, A and B.
Key information from the problem:
\[ n(A) > 1 \quad \text{and} \quad n(B) > 1 \]
\[ n(A \times B) = 35 \]
\[ n(A) \times n(B) = 35 \]
\[ n(B) < n(A) \]
We need to find the possible integer values for \( n(A) \) and \( n(B) \) such that their product is 35 and both are greater than 1. The factor pairs of 35 are (1, 35), (5, 7), (7, 5), and (35, 1).
Since \( n(A) > 1 \) and \( n(B) > 1 \), we exclude the pairs (1, 35) and (35, 1).
The remaining possibilities for \( (n(A), n(B)) \) are (5, 7) and (7, 5).
Now we apply the condition \( B \subset A \), which implies \( n(B) < n(A) \).
Therefore, the only possibility is \( n(A) = 7 \) and \( n(B) = 5 \).
The question asks to find the value of the expression \( \frac{n(A)^C}{n(B)} \). The notation \( n(A)^C \) is non-standard and ambiguous. Common interpretations like complement \( n(A^C) \) require a universal set, which is not given. If 'C' is just a label for the result, the expression might be interpreted differently.
However, let's examine the options: (A) 28, (B) 35, (C) 42, (D) 21.
We have \( n(A) = 7 \) and \( n(B) = 5 \).
Given that the provided answer is (D) 21, it suggests that despite the unclear notation, the intended result is 21.
There might be a typo in the expression, or it follows a convention not universally recognized.
For example, if the expression was intended to be something like \( n(A) \times (n(A) - n(A \cap B)) \) (assuming \(B \subset A \implies A \cap B = B\)) resulting in \(n(A) \times (n(A) - n(B))\) = \(7 \times (7 - 5) = 7 \times 2 = 14\), which is not an option. Or perhaps \( n(A) \times (n(B)-2) = 7 \times (5-2) = 7 \times 3 = 21 \). This matches option D, but the formula is arbitrary.
Assuming the intended answer corresponding to option D is correct, we select 21.
The correct answer is (D) : 21.
A block of certain mass is placed on a rough floor. The coefficients of static and kinetic friction between the block and the floor are 0.4 and 0.25 respectively. A constant horizontal force \( F = 20 \, \text{N} \) acts on it so that the velocity of the block varies with time according to the following graph. The mass of the block is nearly (Take \( g = 10 \, \text{m/s}^2 \)):
A wooden block of mass M lies on a rough floor. Another wooden block of the same mass is hanging from the point O through strings as shown in the figure. To achieve equilibrium, the coefficient of static friction between the block on the floor and the floor itself is