Consider the following statements for a fixed natural number n: 1. C(n, r) is greatest if n = 2r 2. C(n, r) is greatest if n = 2r - 1 and n = 2r + 1 Which of the statements given above is/are correct ?
2 only
The binomial coefficient, denoted as C(n, r) or $\binom{n}{r}$, represents the number of ways to choose $r$ items from a set of $n$ distinct items. For a fixed natural number $n$, the values of C(n, r) for $r = 0, 1, 2, \dots, n$ form a row in Pascal's triangle. These values increase from $r=0$ up to a certain point and then decrease towards $r=n$. The greatest value(s) of C(n, r) for a fixed $n$ occur in the middle of this sequence.
The position of the greatest value(s) of C(n, r) depends on whether $n$ is an even or an odd number.
If $n$ is even, say $n = 2k$ for some integer $k$, the sequence of binomial coefficients C(n, 0), C(n, 1), ..., C(n, n) has a single peak. The maximum value occurs at the very middle term, which is when $r = n/2$.
For example, if $n=4$, the coefficients are C(4,0)=1, C(4,1)=4, C(4,2)=6, C(4,3)=4, C(4,4)=1. The greatest value is C(4,2)=6, which occurs at $r=2$. Here, $n=4$ is even, and $r=2 = n/2$. Notice that $n = 2r$ (4 = 2*2) holds for this maximizing $r$.
If $n=6$, the coefficients are C(6,0)=1, C(6,1)=6, C(6,2)=15, C(6,3)=20, C(6,4)=15, C(6,5)=6, C(6,6)=1. The greatest value is C(6,3)=20, which occurs at $r=3$. Here, $n=6$ is even, and $r=3 = n/2$. Notice that $n = 2r$ (6 = 2*3) holds for this maximizing $r$.
Statement 1 says: C(n, r) is greatest if n = 2r
This statement suggests that for C(n, r) to be the greatest value for a fixed $n$, the condition $n = 2r$ must hold for that specific $r$. This implies $r = n/2$. As we've seen, this is where the maximum occurs when $n$ is even. However, the statement implies this is the condition for C(n,r) to be greatest in general. This is not true for odd $n$, as we will see in the next case. For example, if $n=5$, the greatest values are C(5,2) and C(5,3). For $r=2$ or $r=3$, $n=5$ is not equal to $2r$. Thus, C(n,r) can be greatest even if $n \neq 2r$. Therefore, statement 1 is not a universally correct condition for C(n,r) to be greatest.
If $n$ is odd, say $n = 2k + 1$ for some integer $k$, the sequence of binomial coefficients C(n, 0), C(n, 1), ..., C(n, n) has two equal peak values. These maximum values occur at the two middle terms, which are when $r = (n-1)/2$ and $r = (n+1)/2$. Note that $(n-1)/2 + (n+1)/2 = n$, and the two values are adjacent integers.
For example, if $n=5$, the coefficients are C(5,0)=1, C(5,1)=5, C(5,2)=10, C(5,3)=10, C(5,4)=5, C(5,5)=1. The greatest values are C(5,2)=10 and C(5,3)=10, which occur at $r=2$ and $r=3$. Here, $n=5$ is odd, $(n-1)/2 = (5-1)/2 = 2$, and $(n+1)/2 = (5+1)/2 = 3$.
Let's check the relationships between $n$ and $r$ for these maximizing values:
So, when $n$ is odd, the greatest values occur for the two r-values that satisfy $n = 2r + 1$ or $n = 2r - 1$.
Statement 2 says: C(n, r) is greatest if n = 2r - 1 and n = 2r + 1
The phrasing "n = 2r - 1 and n = 2r + 1" is mathematically impossible for a single value of $n$ and $r$. However, based on the context of binomial coefficients and the typical way such properties are described, and considering the maximizing values occur at two different r-values when n is odd, this statement is likely intended to refer to the odd case. It suggests that the condition for C(n,r) to be greatest involves relationships $n=2r-1$ and $n=2r+1$ being satisfied by the maximizing $r$ values when $n$ is odd. As shown in the example for $n=5$, the two maximizing r values (2 and 3) indeed satisfy $n=2r+1$ (for r=2) and $n=2r-1$ (for r=3).
Interpreting statement 2 charitably, it describes the conditions on $n$ and the maximizing $r$ values in the case when $n$ is odd and has two equal greatest coefficients. This covers the situation for odd $n$ where C(n,r) is greatest.
Statement 1 provides a condition ($n=2r$ or $r=n/2$) which is where the maximum occurs only when $n$ is even. It is not the general condition for C(n,r) to be greatest for any $n$. Thus, statement 1 is incorrect.
Statement 2, despite its awkward "and" phrasing, describes the relationships between $n$ and the maximizing $r$ values ($n=2r-1$ and $n=2r+1$) which are satisfied by the two central terms when $n$ is odd. This statement correctly identifies the situation for maximum C(n,r) when $n$ is odd. Thus, statement 2 is correct under the intended interpretation.
Therefore, only statement 2 is correct.
| Property | Condition on $n$ | Maximizing $r$ value(s) | Relationship(s) between $n$ and $r$ |
|---|---|---|---|
| Greatest C(n, r) | $n$ is even ($n=2k$) | $r = n/2 = k$ | $n = 2r$ |
| Greatest C(n, r) | $n$ is odd ($n=2k+1$) | $r_1 = (n-1)/2 = k$ $r_2 = (n+1)/2 = k+1$ |
$n = 2r_1 + 1$ $n = 2r_2 - 1$ |
The formula for the binomial coefficient C(n, r) is given by:
$$\binom{n}{r} = \frac{n!}{r!(n-r)!}$$
where $n!$ (n factorial) is the product of all positive integers up to $n$.
Important properties of binomial coefficients include:
The problem focuses on finding the largest term(s) in the expansion of $(x+y)^n$, where the coefficients are C(n, r).
In how many ways can a team of 5 players be selected from 8 players so as not to include a particular player?
How many four-digit natural numbers are there such that all of the digits are odd ?
If different permutations of the letters of the word 'MATHEMATICS' are listed as in a dictionary, how many words (with or without meaning) are there in the list before the first word that starts with C ?
If P (n, r) = 2520 and C (n, r) = 21, then what is the value of C (n + 1, r + 1)?
If n! has 17 zeros, then what is the value of n?
What is C(47, 4) + C(51, 3) + C(50, 3) + C(49, 3) + C(48, 3) + C(47, 3) equal to?
Let x be the number of integers lying between 2999 and 8001 which have at least two digits equal. Then x is equal to
There are 17 cricket players, out of which 5 players can bowl. In how many ways can a team of 11 players be selected so to include 3 bowlers?
The total number of 5 - digit numbers that can be composed of distinct digits from 0 to 9 is
What is the sum of all three-digit numbers that can be formed using all the digits 3,4 and 5 where repetition of digits is not allowed?
Three boxes are coloured red, blue and green and so are three balls. In how many ways can one put the balls one in each box such that no ball goes into the box of its own colour?
Six indistinguishable balls are to be distributed amongst A, B and C, such that each gets at least one. Then the number of ways to make this distribution is
A palindrome is a word that reads the same backwards and forwards. For example, the word LEVEL is a palindrome. If we are allowed to construct words that need not have a meaning, then in how many different ways can we construct a five-letter palindrome using English alphabets?
If nPr = 720 and nCr = 120, then the value of r is:
What will be the number of permutations of n different things, taken r at a time, where repeatition is allowed?