Page 1
Exponential Series
Exponential Series
Exponential & Logarithmic Series, Means
1. Exponential Series
- For every real x the series below converges (all x ∈ R).
ex = 1 + x1! + x²2! + x³3! + … ∞ = Σr=0∞ xrr!
e−x = 1 − x1! + x²2! − x³3! + … = Σr=0∞ (−1)r xrr!
Put x = 1 and x = −1 :
e = 10! + 11! + 12! + 13! + … ≈ 2.718 ; e−1 = 10! − 11! + 12! − …
- 2 < e < 3, e is irrational ; ln e = 1.
2. Even & Odd Parts
ex + e−x2 = 1 + x²2! + x⁴4! + x⁶6! + … (even powers)
ex − e−x2 = x1! + x³3! + x⁵5! + … (odd powers)
10! + 12! + 14! + … = e + e−12 ; 11! + 13! + 15! + … = e − e−12
- Any shift of the index does not change the value :
Σn=1∞ 1(n−1)! = Σn=2∞ 1(n−2)! = Σn=0∞ 1n! = e ; Σn=1∞ 1n! = e − 1
3. Series of type Σ P(n)n!
- Method : write the polynomial P(n) in falling factorials n, n(n−1), n(n−1)(n−2)… so each part cancels with n!.
nn! = 1(n−1)! , n(n−1)n! = 1(n−2)! , n(n−1)(n−2)n! = 1(n−3)!
n² = n(n−1) + n ; n³ = n(n−1)(n−2) + 3n(n−1) + n
| Series (n from 1 to ∞) | Sum |
|---|---|
| Σ 1n! | e − 1 |
| Σ nn! | e |
| Σ n²n! | 2e |
| Σ n³n! | 5e |
| Σn=0∞ (−1)nn! | 1e |
- If the denominator is (n+k)!, write the numerator in powers of (n+k) first, e.g. k²+3k+3(k+2)! : k²+3k+3 = (k+2)(k+1) + 1 ⇒ term = 1k! + 1(k+2)!.
- Denominator (2n)! or (2n+1)! ⇒ break into 1(2n−1)!, 1(2n)! … and use the even / odd part sums.
Key Points :
- ex series has all positive terms for x > 0; e−x alternates.
- Always check the starting index : Σ0 1/n! = e but Σ1 1/n! = e − 1.
- A sum like a·e + be + c with integers a, b, c ⇒ compare the e-part, the e−1-part and the constant separately.
Page 2
Logarithmic Series
Logarithmic Series
4. Logarithmic Series (base e)
ln(1 + x) = x − x²2 + x³3 − x⁴4 + … , −1 < x ≤ 1
ln(1 − x) = −(x + x²2 + x³3 + x⁴4 + …) , −1 ≤ x < 1
ln1 + x1 − x = 2(x + x³3 + x⁵5 + …) , −1 < x < 1
- Put x = 1 : ln 2 = 1 − 12 + 13 − 14 + …
- Σn=1∞ xnn = −ln(1 − x) ; Σn=1∞ (−1)n+1xnn = ln(1 + x).
5. Using the Log Series in Sums
- (a) Partial fraction : 1n(n+1) = 1n − 1n+1 ⇒ Σxnn(n+1) splits into two log series.
- (b) Shift the power : Σxn+1n+1 = −ln(1 − x) − 0 (starts at n = 0) ; Σn=1xn+1n+1 = −ln(1 − x) − x.
- (c) Alternating harmonic : 11·2 − 12·3 + 13·4 − … = 2 ln 2 − 1.
- (d) Mixed terms : 2n+1n+1 xn+1 = 2xn+1 − xn+1n+1 ⇒ GP part + log part.
Σn=1∞ xnn(n+1) = 1 + (1 − x) ln(1 − x)x , 0 < |x| < 1
Key Points :
- ln series converge only for |x| ≤ 1 (end points as written) — check the value of x first.
- Recognise 1 + x2 + x²3 … type sums by multiplying with x to make the power match the denominator.
- Logs of a product → sum of logs : log(A₁H₁) + … + log(AnHn) = log(product).
Page 3
Telescoping Series
Telescoping Series
6. Special Telescoping Series
- Write Tn = f(n + 1) − f(n) (or f(n) − f(n + 1)); then Sn = f(n + 1) − f(1) — all middle terms cancel.
n · n! = (n + 1)! − n! ⇒ Σn=1N n · n! = (N + 1)! − 1
n(n + 1)! = 1n! − 1(n + 1)! ⇒ Σn=1N n(n + 1)! = 1 − 1(N + 1)!
(r² + 1) · r! = r · (r + 1)! − (r − 1) · r! ⇒ Σr=1N (r² + 1) r! = N · (N + 1)!
- Check : r(r + 1)! − (r − 1)r! = r![r(r + 1) − (r − 1)] = r!(r² + 1) ✓.
- Trick for factorial sums : add and subtract 1 in the factor, e.g. n = (n + 1) − 1.
7. Telescoping with Fractions
1n(n+1) = 1n − 1n+1 ; 1n(n+1)(n+2) = 12(1n(n+1) − 1(n+1)(n+2))
r(r+1)(r+2) 2r−1 = 2rr + 2 − 2r−1r + 1 ⇒ Σ1N = 2NN + 2 − 12
kk⁴ + k² + 1 = 12(1k² − k + 1 − 1k² + k + 1) (k⁴+k²+1 = (k²+k+1)(k²−k+1))
kk⁴ + 1/4 = 12k² − 2k + 1 − 12k² + 2k + 1 (4k⁴ + 1 = (2k²+2k+1)(2k²−2k+1))
√(1 + 1k² + 1(k+1)²) = 1 + 1k − 1k + 1
Key Points :
- Factorise quartics like k⁴ + k² + 1 or 4k⁴ + 1 as a difference of squares; the two factors differ by 2k (or 4k).
- Recurrences an+1 = 12an + … : define bn = an − (correction) so that bn becomes a GP.
- Given Sn, the term is an = Sn − Sn−1 (n ≥ 2); for Sn = An² + Bn ⇒ AP with d = 2A.
Page 4
AP, GP, HP & Means
AP, GP, HP & Means
8. AP, GP, HP — quick revision
AP : Tn = a + (n − 1)d , Sn = n2[2a + (n − 1)d]
GP : Tn = arn−1 , S∞ = a1 − r (|r| < 1)
HP : reciprocals are in AP ⇒ Tn = 11a + (n − 1)D
- mth term of HP = n and nth term = m ⇒ pth term = mnp, (m + n)th term = mnm + n.
- Ball dropped from h, each rebound = r × previous height ⇒ total distance = h1 + r1 − r (h = 100, r = 3/4 ⇒ 700).
- 4 numbers : a, b, c in AP and b, c, d in GP ⇒ use a = b − δ, c = b + δ, d = c²/b.
9. AM, GM, HM, RMS
RMS = √a₁² + … + an²n ≥ AM = a₁ + … + ann ≥ GM = (a₁a₂…an)1/n ≥ HM = nΣ 1/ai
- Valid for positive numbers; equality ⇔ a₁ = a₂ = … = an.
- Descending order : RMS ≥ A ≥ G ≥ H.
- Two numbers : G² = AH (A, G, H in GP).
10. Inserting n Means between a and b
AMs : d = b − an + 1 , Ak = a + kd ; A₁ + A₂ + … + An = n·a + b2
GMs : r = (ba)1/(n+1) ; G₁G₂…Gn = (√(ab))n
HMs : 1Hk = 1a + k·a − bab(n + 1) ; Ak · Hn+1−k = ab
- A1Hn = A2Hn−1 = … = ab (equidistant AM × HM pair).
- Repeated means of two positive unequal numbers (Ak, Gk, Hk from Ak−1, Hk−1) : A₁ > A₂ > A₃ …, G₁ = G₂ = G₃ …, H₁ < H₂ < H₃ …
Key Points :
- Sum of inserted AMs depends only on the end points : n(a + b)/2.
- If a sequence is AP and another (same end points) is HP, then AkHn+1−k = ab helps sum products quickly.
- For bi > 1 with log bi in AP ⇒ bi in GP; compare AP vs GP sums with AM ≥ GM.
Page 5
Min–Max using AM ≥ GM
Min–Max using AM ≥ GM
11. Minimum / Maximum using AM ≥ GM
- (a) Product constant ⇒ sum minimum : x + 1x ≥ 2 (x > 0), equality at x = 1.
- (b) Sum constant ⇒ product maximum (all terms positive).
- (c) Unequal powers : split the variable into equal parts so the product becomes constant.
a cos²x + b sec²x ≥ 2√(ab) (a, b > 0) e.g. 8cos²x + 2sec²x ≥ 8
x² + 1x² + 1 = (x² + 1) + 1x² + 1 − 1 ≥ 2 − 1 = 1 (at x = 0)
x + y + z = 1 (x, y, z > 0) : x2 + x2 + y + z = 1 ⇒ x²yz ≤ 44⁴ = 164
a + b + c = 3 : (a/2 + a/2 + b/3 + b/3 + b/3 + c/2 + c/2)/7 ≥ (…)1/7 ⇒ a²b³c² ≤ 3¹⁰ · 2⁴7⁷
12. RMS ≥ AM & Cauchy–Schwarz
a + b + c + d = 1 ⇒ √a + √b + √c + √d ≤ 4 · √a+b+c+d4 = 2
(x² + y²)(p² + q²) ≥ (px + qy)² ⇒ 2x + 3y = 5 ⇒ x² + y² ≥ 2513
a + b + c = 1 ⇒ a² + b² + c² ≥ 13
- For negative terms make them positive first : a < 0 ⇒ 1, −a, a² > 0 ⇒ 1 − a + a² ≥ 3·(−a³)1/3 = −3a ⇒ product of n such brackets ≥ 3n(−a₁)(−a₂)…(−an).
- a(b² + c²) + b(c² + a²) + c(a² + b²) ≥ 6abc (each bracket ≥ 2·product).
Key Points :
- AM ≥ GM gives a bound; it is the min/max only if equality is attainable — always check the equality case.
- Number of equal parts = power of the variable in the product.
- For a + b + c = 1 type conditions, symmetric expressions are extreme when a = b = c.
Page 6
Additional Results (from lectures)
Additional Results (from lectures)
13. Standard Sums & Facts
Σn = n(n + 1)2 ; Σn² = n(n + 1)(2n + 1)6 ; Σn³ = (n(n + 1)2)²
- 1 + 3 + 5 + … (n terms) = n² ; alternating cubes : 1³ − 2³ + 3³ − … = Σodd³ − Σeven³.
- Σr=1n r(n − r) = n(n² − 1)6.
- ln(1 − x²) = −(x² + x⁴2 + x⁶3 + …), |x| < 1 (put x → x² in ln(1 − x)).
- 0! = 1, (n + 1)! = (n + 1)·n! ; n(n + 1)! = 1n! − 1(n + 1)!.
- If second differences of Tn are constant ⇒ Tn = an² + bn + c (find a, b, c from first 3 terms).
- If a quadratic f satisfies f(0) = f(1) = f(2) ⇒ f is constant (a sum of squares = 0 ⇒ each square = 0).
14. More Telescoping & Means
- an+1 = an² + an ⇒ 1an + 1 = 1an − 1an+1 (telescopes).
- r + 22r+1 r(r + 1) = 12r r − 12r+1(r + 1) ⇒ Σ1∞ = 12.
- r · 2r−1(r + 1)(r + 2) = 2rr + 2 − 2r−1r + 1 ⇒ Σ1n = 2nn + 2 − 12.
- kk⁴ + 1/4 = 1k² − k + 1/2 − 1k² + k + 1/2 ⇒ Σ1n = 2n² + 2n2n² + 2n + 1.
- Three terms in GP : take ar, a, ar (product = a³) ; in AP : a − d, a, a + d.
- Largest term / max of product with fixed sum : use AM ≥ GM, equality when the parts are equal.
- Weighted Cauchy–Schwarz : a + b + c = 1 ⇒ a² + 2b² + c² ≥ 25 (weights 1, 12, 1).
- a(b² + c²) + b(c² + a²) + c(a² + b²) ≥ 6abc (AM ≥ GM on six terms), a, b, c > 0.