Home › CAT › quantitativeaptitude › Permutations and Combinations › $\binom{n}{r} + \binom{n}{r-1}$ equals
$\binom{n}{r} + \binom{n}{r-1}$ equals
A$\binom{n+1}{r}$
B$\binom{n-1}{r}$
C$\binom{n}{r+1}$
D$\binom{2n}{r}$
Answer & Solution
Correct answer: A. $\binom{n+1}{r}$
1. This is PASCAL'S IDENTITY (a fundamental combinatorial identity): $\binom{n}{r} + \binom{n}{r-1} = \binom{n+1}{r}$.
2. Geometrically: it's the rule for building Pascal's triangle — each entry is the sum of the two entries directly above it.
3. Algebraic proof: $\binom{n}{r} = \dfrac{n!}{r!(n-r)!}$ and $\binom{n}{r-1} = \dfrac{n!}{(r-1)!(n-r+1)!}$. Common denominator and simplify yields $\dfrac{(n+1)!}{r!(n+1-r)!} = \binom{n+1}{r}$.
4. Combinatorial proof: number of ways to choose $r$ from $n+1$ objects = (ways INCLUDING object $n+1$) + (ways EXCLUDING it) = $\binom{n}{r-1} + \binom{n}{r}$.
5. Example: $n = 4, r = 2$: $\binom{4}{2} + \binom{4}{1} = 6 + 4 = 10 = \binom{5}{2}$ ✓.
6. Other options have wrong indices.
_Source: NCERT Class 11 Mathematics, Ch 6, §6.4 (Pascal's identity), p. 11._
Related questions
Number of ways to choose 2 items out of 5:Number of permutations of letters in WORD:How many DIAGONALS does a regular DECAGON (10-sided polygon) have?Find the number of ways a person can travel from city A to city C if there are 3 routes frHow many distinct 'numbers' (with REPETITION ALLOWED) can be formed using the digits 0, 1,The number of ways to select 2 boys and 3 girls from a group of 5 boys and 4 girls isHow many distinct 4-digit numbers can be formed using the digits 1, 2, 3, 4, 5, 6 (each diIn how many ways can the letters of the word 'TRIANGLE' be arranged such that all the VOWE