Part of ALG-06 — Binomial Theorem

Numerically Greatest Term Technique

by Notetube Official87 words7 views

For (a + b)^n = sum C(n,r)anra^{n-r}brb^r, the ratio of consecutive terms: |Tr+1T_{r+1}/TrT_r| = |nr+1r\frac{n-r+1}{r}| * |b/a|.

Set |Tr+1T_{r+1}/TrT_r| >= 1: r <= (n+1)|b|/(|a|+|b|).

Let this bound be m. If m is integer, TmT_m and Tm+1T_{m+1} are both numerically greatest. If m is not integer, Tfloor(m)+1T_{floor(m)+1} is the unique greatest term.

Example: Numerically greatest term of (2+3x)^9 when x = 1. |b/a| = 3/2. Bound: 103/5 = 6. Since m = 6 is integer, T6T_6 and T7T_7 are both greatest. T7T_7 = C(9,6)2^33^6 = 848*729 = 489888.

Like these notes? Save your own copy and start studying with NoteTube's AI tools.

Sign up free to clone these notes