We begin with the standard binomial expansion
(x+y)n=∑k=0n(kn)xn−kyk.
The “sum of the coefficients’’ is obtained by putting x=1 and y=1, because each term (kn)xn−kyk then reduces to just (kn). Thus we have
(1+1)n=2n=∑k=0n(kn).
The question tells us that this sum equals 4096, so
2n=4096.
We now solve for n. Recognising 4096 as a power of 2, we write
4096=212,
and therefore
n=12.
So the expansion we are really interested in is
(x+y)12.
Next, we must find the greatest (i.e. the largest numerical) binomial coefficient among (012),(112),…,(1212). A basic result from the theory of binomial coefficients states:
The sequence (0n),(1n),…,(nn) increases up to k=⌊2n⌋ and then decreases symmetrically.
Since n=12 is even, the maximum value occurs at
k=2n=212=6.
The corresponding coefficient is therefore
(612).
We compute it explicitly using the formula (kn)=k!(n−k)!n!:
(612)=6!6!12!=6!(6×5×4×3×2×1)12×11×10×9×8×7×6!=6×5×4×3×2×112×11×10×9×8×7.
We simplify step by step:
First cancel the factor 6:
612=2
so one pair of factors becomes 2. Proceeding orderly, we have
5×4×3×2×12×11×10×9×8×7.
Now cancel a factor 5 with the 10:
10÷5=2,
giving
4×3×2×12×11×2×9×8×7.
Next cancel a factor 4 with the 8:
8÷4=2,
so we obtain
3×2×12×11×2×9×2×7.
Cancel a factor 3 with the 9:
9÷3=3,
giving
2×12×11×2×3×2×7.
Finally cancel the remaining denominator 2 with one of the numerators 2, leaving
11×2×3×2×7.
Multiplying in order,
11×2=22,22×3=66,66×2=132,132×7=924.
Thus
(612)=924.
Hence, the correct answer is Option 924.