Chapter 15 — Appendix A.1: Infinite Series

Appendix A.1 of the Class 11 Maths NCERT textbook covers four special infinite series — the Binomial Series for any real index m, the Infinite Geometric Series, the Exponential Series defining the number e, and the Logarithmic Series — with their expansions, convergence conditions, and worked examples.

• The binomial theorem for any index — The appendix generalises the binomial theorem beyond whole-number powers to any real index m, giving (1+x)^m as an infinite series that holds when |x| < 1 — extending a finite expansion into an infinite one.
• Geometric series and the birth of e — It derives the sum of an infinite geometric series when the ratio is small, then uses the exponential series to define Euler's number e and its general expansion e^x, tying a famous constant to an infinite sum.
• The logarithmic series — Finally it expresses the natural logarithm log_e(1+x) as an infinite series valid for |x| < 1, and shows how a special substitution yields a series for log_e 2, extending series methods to logarithms.

1. 01An infinite series is the indicated sum a1 + a2 + a3 + ... of an infinite sequence, expressible in sigma notation as ∑ak from k = 1 to ∞.
2. 02The Binomial Theorem for any index states (1+x)^m = 1 + mx + m(m–1)x²/1·2 + m(m–1)(m–2)x³/1·2·3 + ..., valid when |x| < 1, where m may be a negative integer or a fraction.
3. 03For the expansion of (a+b)^m, the series is valid when |b| < |a|; the general term is m(m–1)(m–2)···(m–r+1) · a^(m–r) · b^r / (1·2·3···r).
4. 04The Infinite Geometric Series a + ar + ar² + ... converges to S = a/(1–r) whenever |r| < 1; when |r| ≥ 1 the series does not have a finite sum.
5. 05The number e — introduced by Leonhard Euler in his calculus text in 1748 — is defined as the sum of the series 1 + 1/1! + 1/2! + 1/3! + ..., and satisfies 2 < e < 3.
6. 06The Exponential Series gives e^x = 1 + x/1! + x²/2! + x³/3! + ... + x^n/n! + ... for any value of x.
7. 07The Logarithmic Series states log_e(1+x) = x – x²/2 + x³/3 – x⁴/4 + ..., valid for |x| < 1; substituting x = 1 (a valid case) gives log_e 2 = 1 – 1/2 + 1/3 – 1/4 + ...