Let A be a set containing n elements. A subset P of A is chosen, and the set A is reconstructed by replacing the elements of P. A subset Q of A is chosen again. The number of ways of choosing P and Q such that Q contains just one element more than P is
\({}^{2n}C_{n-1}\)
The choices of P and Q are independent (A is restored before Q is chosen), so the count is a sum over the size of P, and the sum collapses by Vandermonde's identity.
Step 1 — If P has r elements, it can be chosen in \({}^{n}C_{r}\) ways, and Q must have r + 1 elements, chosen in \({}^{n}C_{r+1}\) ways.
Step 2 — The total is \(\sum_{r=0}^{n-1} {}^{n}C_{r}\,{}^{n}C_{r+1}\).
Step 3 — Write \({}^{n}C_{r+1} = {}^{n}C_{n-r-1}\). Then the sum is \(\sum_{r} {}^{n}C_{r}\,{}^{n}C_{n-1-r}\), the coefficient of \(x^{n-1}\) in \((1+x)^{n}(1+x)^{n} = (1+x)^{2n}\).
Step 4 — That coefficient is \({}^{2n}C_{n-1}\) (equal to \({}^{2n}C_{n+1}\)). For n = 1 this gives 1, matching the single choice P = ∅, Q = A.
\({}^{2n}C_{n}\) counts pairs with equal sizes, \({}^{2n}C_{n+2}\) corresponds to a size difference of two, and \(2^{2n+1}\) exceeds even the total number of pairs \(2^{2n}\).
\({}^{2n}C_{n-1}\) option is correct.
A letter lock consists of three rings with 15 different letters. If N denotes the number of ways in which it is possible to make unsuccessful attempts to open the lock, then
If z1 and z2 are two complex numbers satisfying the equation \(\left|\dfrac{z_1 + z_2}{z_1 - z_2}\right| = 1\), then \(\dfrac{z_1}{z_2}\) may be
If R and R1 are equivalence relations on a set A, then so are the relations
Let a1, a2, a3, …, an be positive real numbers. Then the minimum value of
\(\dfrac{a_1}{a_2} + \dfrac{a_2}{a_3} + \ldots + \dfrac{a_n}{a_1}\) is
Consider a quadratic equation ax2 + 2bx + c = 0 where a, b, c are positive real numbers. If the equation has no real root, then which of the following is true ?
Let A = \(\begin{pmatrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}\), B = \(\begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix}\) and P = \(\begin{pmatrix} 0 & 1 & 0 \\ x & 0 & 0 \\ 0 & 0 & y \end{pmatrix}\) be an orthogonal matrix such that B = PAP−1 holds. Then
Let ρ be a relation defined on set of natural numbers ℕ, as ρ = \(\{(x, y) \in \mathbb{N} \times \mathbb{N} : 2x + y = 41\}\). Then domain A and range B are
Let P(n) = 32n + 1 + 2n + 2 where n ∈ ℕ. Then
Let A and B are orthogonal matrices and det A + det B = 0. Then
If one root of x2 + px − q2 = 0, p and q are real, be less than 2 and other be greater than 2, then
Let S be the set of the first 11 natural numbers. Then the number of elements in $A = \{B \subseteq S : n(B) \geq 2$ and the product of all elements of B is even is ________.
If $ \left(\frac{1}{^{15}C_0} + \frac{1}{^{15}C_1}\right)$ $\left(\frac{1}{^{15}C_1} + \frac{1}{^{15}C_2}\right)$ $\dots$ $ \left(\frac{1}{^{15}C_{12}} + \frac{1}{^{15}C_{13}}\right)$ = $\frac{\alpha^{13}}{^{14}C_0 ^{14}C_1 \dots ^{14}C_{12}} $, then $30\alpha$ is equal to __________.