Core Logic
Expand the expression:
(1 + x²)² (1 + x)ⁿ = (1 + 2x² + x⁴) · Σr=0ⁿ ⁿCᵣ x^r$$(1 + x^2)^2 (1 + x)^n = (1 + 2x^2 + x^4) \cdot \sum_{r=0}^n {^nC_r x^r}$$
We need the coefficients of x$x$, x²$x^2$, and x³$x^3$.
For x¹$x^1$: Multiplier is 1 · ⁿC₁x = ⁿC₁$1 \cdot {^nC_1}x = {^nC_1}$.
For x²$x^2$: Multiplier is 1 · ⁿC₂x² + 2x² · ⁿC₀ = ⁿC₂ + 2$1 \cdot {^nC_2}x^2 + 2x^2 \cdot {^nC_0} = {^nC_2} + 2$.
For x³$x^3$: Multiplier is 1 · ⁿC₃x³ + 2x² · ⁿC₁x = ⁿC₃ + 2ⁿC₁$1 \cdot {^nC_3}x^3 + 2x^2 \cdot {^nC_1}x = {^nC_3} + 2{^nC_1}$.
These three coefficients are in Arithmetic Progression (A.P.).
Step 1: Set up the A.P. Condition
If A, B, C$A, B, C$ are in A.P., then 2B = A + C$2B = A + C$.
2(ⁿC₂ + 2) = ⁿC₁ + (ⁿC₃ + 2ⁿC₁)$$2({^nC_2} + 2) = {^nC_1} + ({^nC_3} + 2{^nC_1})$$
2((n(n-1))/(2) + 2) = 3n + (n(n-1)(n-2))/(6) (assuming n ≥ 3)$$2\left(\frac{n(n-1)}{2} + 2\right) = 3n + \frac{n(n-1)(n-2)}{6} \quad (\text{assuming } n \geq 3)$$
Step 2: Solve the Polynomial Equation
n(n-1) + 4 = 3n + (n(n-1)(n-2))/(6)$$n(n-1) + 4 = 3n + \frac{n(n-1)(n-2)}{6}$$
Multiply by 6$6$:
6n² - 6n + 24 = 18n + n(n² - 3n + 2)$$6n^2 - 6n + 24 = 18n + n(n^2 - 3n + 2)$$
6n² - 6n + 24 = 18n + n³ - 3n² + 2n$$6n^2 - 6n + 24 = 18n + n^3 - 3n^2 + 2n$$
n³ - 9n² + 26n - 24 = 0$$n^3 - 9n^2 + 26n - 24 = 0$$
Testing integer roots, for n = 2$n = 2$:
8 - 36 + 52 - 24 = 0 ⇒ n=2$8 - 36 + 52 - 24 = 0 \Rightarrow n=2$ is a root (wait, A.P. works for n=2$n=2$ also, let's check later).
For n = 3$n = 3$:
27 - 81 + 78 - 24 = 0 ⇒ n=3$27 - 81 + 78 - 24 = 0 \Rightarrow n=3$ is a root.
For n = 4$n = 4$:
64 - 144 + 104 - 24 = 0 ⇒ n=4$64 - 144 + 104 - 24 = 0 \Rightarrow n=4$ is a root.
Step 3: Verification of Roots
Check for n = 2$n = 2$ (since our formula assumed n ≥ 3$n \ge 3$, ²C₃=0${^2C_3}=0$):
Coeff of x = 2$x = 2$, Coeff of x² = 1+2 = 3$x^2 = 1+2 = 3$, Coeff of x³ = 0 + 2(2) = 4$x^3 = 0 + 2(2) = 4$.
Sequence is 2, 3, 4$2, 3, 4$ which is an A.P. So n=2$n=2$ is valid.
The values of n$n$ are 2, 3, 4$2, 3, 4$.
Required sum of values = 2 + 3 + 4 = 9$2 + 3 + 4 = 9$.
Pattern Recognition
Whenever binomial limits logically constrain formulas (like ⁿC₃$^nC_3$ demanding n≥ 3$n\geq 3$), explicitly check the lower bounds manually (n=2$n=2$) to avoid dropping edge-case roots from the algebraic polynomial factorization.
Chapter Mix
Class 11 Maths: Binomial Theorem