Concept:
For any binomial coefficient \( {}^{m}C_{r} \), the maximum value occurs at the middle term:
• If \( m \) is even, the greatest value occurs at \( r = \frac{m}{2} \).
• If \( m \) is odd, the greatest values occur at \( r = \frac{m-1}{2} \) and \( r = \frac{m+1}{2} \).
Step 1: Finding the greatest value \( a \).
The upper index is \( 2n \), which is an even number. Therefore, the greatest value \( a \) occurs at \( r = \frac{2n}{2} = n \):
\[
a = {}^{2n}C_{n}
\]
Step 2: Finding the greatest value \( b \).
The upper index is \( 2n-1 \), which is an odd number. Therefore, the greatest value \( b \) occurs at \( r = \frac{(2n-1)-1}{2} = n-1 \):
\[
b = {}^{2n-1}C_{n-1}
\]
Step 3: Establishing the relationship between \( a \) and \( b \).
Let us expand \( a = {}^{2n}C_{n} \) using the standard factorial definition:
\[
a = \frac{(2n)!}{n! \cdot n!} = \frac{2n \cdot (2n-1)!}{n \cdot (n-1)! \cdot n!} = \frac{2n}{n} \cdot \frac{(2n-1)!}{(n-1)! \cdot n!}
\]
\[
a = 2 \cdot \frac{(2n-1)!}{(n-1)! \cdot [(2n-1) - (n-1)]!} = 2 \cdot {}^{2n-1}C_{n-1}
\]
Substituting \( b = {}^{2n-1}C_{n-1} \):
\[
a = 2b
\]