Study guide
3.3 Mathematical Induction & the Binomial Theorem
Pakistan ECAT Engineering Colleges Admission Test
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: ECAT Exam Structure, Scoring & Strategy
1.1 ECAT Exam Pattern, Scoring Scheme & UET Merit Aggregate 1.2 Time Management, Pacing & MCQ Problem-Solving Tactics
2 Chapter 2: Mathematics — Number Systems, Sets & Algebra
2.1 Real Numbers, Sets, Logic, Binary Operations & Groups 2.2 Complex Numbers, Modulus, Conjugates & De Moivre's Theorem 2.3 Matrices, Determinants, Inverses & Systems of Linear Equations 2.4 Quadratic Equations, Relations Between Roots & Factor/Remainder Theorems
3 Chapter 3: Mathematics — Sequences, Series & Combinatorics
3.1 Arithmetic, Geometric & Harmonic Progressions (AP, GP, HP) 3.2 Permutations, Combinations & Probability Distributions 3.3 Mathematical Induction & the Binomial Theorem
4 Chapter 4: Mathematics — Trigonometry & Trigonometric Equations
4.1 Fundamental Trigonometric Identities & Angle Addition Formulas 4.2 Graphs of Trigonometric Functions & Inverse Trigonometric Functions 4.3 Solutions of Triangles (Sine/Cosine Laws) & Trigonometric Equations
5 Chapter 5: Mathematics — Functions, Limits & Continuity
5.1 Real-Valued Functions, Types, Domains & Ranges 5.2 Limits of Functions, Indeterminate Forms & Squeeze Theorem 5.3 Continuity, Types of Discontinuity & Asymptotes
6 Chapter 6: Mathematics — Differential Calculus
6.1 Definition of Derivative, Power, Product, Quotient & Chain Rules 6.2 Derivatives of Trigonometric, Exponential & Logarithmic Functions 6.3 Implicit Differentiation, Parametric Equations & Higher-Order Derivatives 6.4 Tangents, Normals, Increasing/Decreasing Functions & Extrema
7 Chapter 7: Mathematics — Integral Calculus
7.1 Indefinite Integration Formulas & Integration by Substitution 7.2 Integration by Parts & Partial Fractions 7.3 Definite Integrals, Properties & Fundamental Theorem of Calculus 7.4 Area Under Curves & First-Order Differential Equations
8 Chapter 8: Mathematics — Analytic Geometry, Linear Programming & Vectors
8.1 Coordinates, Slopes, Straight Line Equations & Distances 8.2 Linear Inequalities & Linear Programming 8.3 Circle Equations, Tangents, Normals & Intersections 8.4 Conic Sections: Parabola, Ellipse & Hyperbola Characteristics 8.5 Vectors in 2D and 3D, Dot Product, Cross Product & Scalar Triple Product
9 Chapter 9: Physics — Measurements, Vectors & Equilibrium
9.1 Physical Quantities, SI Units, Errors & Dimensional Analysis 9.2 Vector Addition, Components, Scalar & Vector Products in Physics 9.3 Equilibrium Conditions, Torque & Rotational Equilibrium
10 Chapter 10: Physics — Kinematics, Dynamics & Energy
10.1 Kinematics: Displacement, Velocity, Acceleration & Motion Equations 10.2 Newton's Laws of Motion, Momentum, Impulse & Elastic Collisions 10.3 Projectile Motion: Trajectory, Height, Flight Time & Range 10.4 Work, Energy, Work-Energy Theorem, Conservative Forces & Power
11 Chapter 11: Physics — Circular Motion, Gravitation, Fluids & Oscillations
11.1 Uniform Circular Motion, Centripetal Force & Moment of Inertia 11.2 Gravitation, Escape Velocity, Satellites & Weightlessness 11.3 Viscosity, Drag Force, Equation of Continuity & Bernoulli's Principle 11.4 Simple Harmonic Motion (SHM), Pendulum, Mass-Spring & Resonance
12 Chapter 12: Physics — Waves, Optics, Optical Instruments & Thermodynamics
12.1 Waves, Speed of Sound, Standing Waves & Doppler Effect 12.2 Wave Theory of Light, Interference & Young's Double-Slit Experiment 12.3 Diffraction Grating, Resolving Power & Polarization of Light 12.4 Optical Instruments: Magnifiers, Microscopes, Telescopes, Spectrometer & Fibre Optics 12.5 Kinetic Theory of Gases, First Law, Heat Engines & Carnot Cycle
13 Chapter 13: Physics — Electrostatics, Current Electricity & Electromagnetism
13.1 Coulomb's Law, Electric Fields, Gauss's Law & Capacitors 13.2 Electric Current, Resistance, Ohm's Law, Kirchhoff's Rules & Potentiometer 13.3 Magnetic Fields, Ampere's Law, Faraday's Law, Lenz's Law & Transformers
14 Chapter 14: Physics — Alternating Current, Physics of Solids & Electronics
14.1 Alternating Current: RMS Values, Reactance, Impedance, Resonance & Power 14.2 Physics of Solids: Elasticity, Band Theory, Superconductors & Magnetic Materials 14.3 Electronics: p-n Junction, Rectifiers, Transistors, Op-Amps & Logic Gates
15 Chapter 15: Physics — Modern, Atomic & Nuclear Physics
15.1 Special Relativity, Mass–Energy Equivalence, Pair Production & Annihilation 15.2 Photoelectric Effect, Photons, Atomic Spectra, X-Rays & Nuclear Reactions 15.3 Lasers, Nuclear Reactors, Radiation Detectors, Dosimetry & Elementary Particles
16 Chapter 16: Chemistry — Basic Concepts, Atomic Structure, Bonding & States of Matter
16.1 Mole Concept, Stoichiometry, Limiting Reactants, Isotopes & Experimental Techniques 16.2 Atomic Structure, Bohr's Model, Quantum Numbers & Electronic Configurations 16.3 Chemical Bonding: Ionic, Covalent & Coordinate Bonds, VSEPR, Hybridization & MOT 16.4 Gas Laws, Ideal Gas Equation, Kinetic Molecular Theory & Real Gases 16.5 Liquids, Intermolecular Forces, Hydrogen Bonding & Crystal Lattices
17 Chapter 17: Chemistry — Energetics, Equilibrium & Kinetics
17.1 Enthalpy Changes, Calorimetry, Hess's Law & Born-Haber Cycle 17.2 Reversible Reactions, Equilibrium Constants (Kc, Kp), Le Chatelier & Ksp 17.3 Solutions, Concentration Units, Colligative Properties & Raoult's Law 17.4 Reaction Rates, Rate Equations, Order of Reaction & Activation Energy
18 Chapter 18: Chemistry — Periodic Trends, s-, p- & d-Block Elements & Electrochemistry
18.1 Periodic Trends: Atomic Radii, Ionization Energies & Electronegativities 18.2 Chemistry of s-Block and p-Block Elements (Groups I, II, III, IV, VII) 18.3 Groups V-A & VI-A: Nitrogen, Phosphorus, Oxygen & Sulphur Compounds 18.4 Transition Elements: Electronic Configurations, Complexes & Colors 18.5 Oxidation Numbers, Electrochemical Cells, Standard Potentials & Batteries
19 Chapter 19: Chemistry — Organic Chemistry & Reaction Mechanisms
19.1 Organic Functional Groups, IUPAC Nomenclature & Structural/Stereoisomerism 19.2 Aliphatic Hydrocarbons: Alkanes, Alkenes, Alkynes & Addition Reactions 19.3 Benzene: Electronic Structure, Resonance Stability & Electrophilic Substitution 19.4 Alkyl Halides (SN1/SN2), Grignard Reagents & Functional-Group Tests 19.5 Alcohols, Phenols & Ethers: Preparation and Reactions 19.6 Aldehydes, Ketones, Carboxylic Acids, Acid Derivatives & Amino Acids
20 Chapter 20: Chemistry — Macromolecules, Chemical Industries & Environment
20.1 Macromolecules: Polymers, Carbohydrates, Proteins, Lipids, Enzymes & Nucleic Acids 20.2 Chemical Industries in Pakistan & Environmental Chemistry
21 Chapter 21: English — Reading Comprehension, Vocabulary & Grammar
21.1 Reading Comprehension Strategies, Main Ideas, Inferences & Tone 21.2 Academic Vocabulary, Context Clues, Synonyms & Antonyms 21.3 Subject-Verb Agreement, Tenses & Grammatical Concord 21.4 Sentence Correction, Parallelism, Modifiers & Prepositions
3.3 Mathematical Induction & the Binomial Theorem
Key Takeaways Explain This Topic AI
The Principle of Mathematical Induction validates a proposition P ( n ) P(n) P ( n ) for all integers n ≥ 1 n \ge 1 n ≥ 1 by verifying base step P ( 1 ) P(1) P ( 1 ) and demonstrating that assuming hypothesis P ( k ) P(k) P ( k ) logically forces step P ( k + 1 ) P(k+1) P ( k + 1 ) to hold.
The Binomial Theorem for a positive integer index n n n expands ( a + b ) n = ∑ r = 0 n n C r a n − r b r (a+b)^n = \sum_{r=0}^n {}^n C_r a^{n-r} b^r ( a + b ) n = ∑ r = 0 n n C r a n − r b r , containing exactly n + 1 n+1 n + 1 terms with general term T r + 1 = n C r a n − r b r T_{r+1} = {}^n C_r a^{n-r} b^r T r + 1 = n C r a n − r b r .
The middle term of ( a + b ) n (a+b)^n ( a + b ) n is uniquely T n 2 + 1 T_{\frac{n}{2}+1} T 2 n + 1 when n n n is even; if n n n is odd, two distinct middle terms exist at positions T n + 1 2 T_{\frac{n+1}{2}} T 2 n + 1 and T n + 3 2 T_{\frac{n+3}{2}} T 2 n + 3 .
The term independent of x x x is found by expressing the variable exponent in general term T r + 1 T_{r+1} T r + 1 as a function of r r r , setting that exponent to zero, and solving for the non-negative integer r r r .
For negative or rational exponents n ∉ N n \notin \mathbb{N} n ∈ / N , the binomial expansion ( 1 + x ) n = 1 + n x + n ( n − 1 ) 2 ! x 2 + … (1+x)^n = 1 + nx + \frac{n(n-1)}{2!}x^2 + \dots ( 1 + x ) n = 1 + n x + 2 ! n ( n − 1 ) x 2 + … yields an infinite series that converges if and only if ∣ x ∣ < 1 |x| < 1 ∣ x ∣ < 1 .
Last updated: October 2026
Mathematical Induction & the Binomial Theorem
Mathematical induction and the binomial theorem provide foundational tools for algebraic proof, power expansion, and functional approximations. On the ECAT, proficiency with the general term formula T r + 1 T_{r+1} T r + 1 , middle term determination, independent term isolation, and coefficient summation shortcuts is essential for scoring highly.
1. Principle of Mathematical Induction (PMI)
The Principle of Mathematical Induction is an axiomatic method of proof used to establish that a statement P ( n ) P(n) P ( n ) is true for all natural numbers n ∈ N n \in \mathbb{N} n ∈ N (or for all integers n ≥ n 0 n \ge n_0 n ≥ n 0 ).
The Three Formal Steps
Base Step (Condition I): Show that the statement is true for the starting index, typically n = 1 n = 1 n = 1 . That is, establish P ( 1 ) P(1) P ( 1 ) as true.
Inductive Hypothesis: Assume that the statement is true for an arbitrary positive integer k k k . That is, hypothesize that P ( k ) P(k) P ( k ) holds.
Inductive Step (Condition II): Using the inductive hypothesis P ( k ) P(k) P ( k ) , prove rigorously that the statement must also be true for the next integer k + 1 k+1 k + 1 . That is, prove P ( k ) ⟹ P ( k + 1 ) P(k) \implies P(k+1) P ( k ) ⟹ P ( k + 1 ) .
Conclusion: If both conditions are satisfied, then by PMI, P ( n ) P(n) P ( n ) is true for all integers n ≥ 1 n \ge 1 n ≥ 1 .
Typical Mathematical Applications
Summation Formulas: Proving standard power identities such as ∑ i = 1 n i 2 = n ( n + 1 ) ( 2 n + 1 ) 6 \sum_{i=1}^n i^2 = \frac{n(n+1)(2n+1)}{6} ∑ i = 1 n i 2 = 6 n ( n + 1 ) ( 2 n + 1 ) .
Divisibility Assertions: Proving that an expression is divisible by an integer for all n n n . For example, proving that a n − b n a^n - b^n a n − b n is divisible by a − b a - b a − b , or that 5 2 n − 1 5^{2n} - 1 5 2 n − 1 is divisible by 24 for all n ≥ 1 n \ge 1 n ≥ 1 .
Inequalities: Establishing bounding relations such as 2 n > n 2 2^n > n^2 2 n > n 2 for all integers n ≥ 5 n \ge 5 n ≥ 5 , or Bernoulli's inequality ( 1 + x ) n ≥ 1 + n x (1+x)^n \ge 1 + nx ( 1 + x ) n ≥ 1 + n x for x > − 1 x > -1 x > − 1 and n ∈ N n \in \mathbb{N} n ∈ N .
Test-Day Strategy: ECAT multiple-choice questions rarely require writing out an entire induction proof. Instead, problems usually ask: "For what positive integers is P ( n ) P(n) P ( n ) true?" Candidates should test small values directly ( n = 1 , 2 , 3 n = 1, 2, 3 n = 1 , 2 , 3 ) to quickly eliminate incorrect answer options in seconds.
2. Binomial Theorem for Positive Integral Exponents ( n ∈ N n \in \mathbb{N} n ∈ N )
For any real or complex numbers a a a and b b b , and any positive integer n n n :
( a + b ) n = n C 0 a n b 0 + n C 1 a n − 1 b 1 + n C 2 a n − 2 b 2 + ⋯ + n C r a n − r b r + ⋯ + n C n a 0 b n (a+b)^n = {}^n C_0 a^n b^0 + {}^n C_1 a^{n-1} b^1 + {}^n C_2 a^{n-2} b^2 + \dots + {}^n C_r a^{n-r} b^r + \dots + {}^n C_n a^0 b^n ( a + b ) n = n C 0 a n b 0 + n C 1 a n − 1 b 1 + n C 2 a n − 2 b 2 + ⋯ + n C r a n − r b r + ⋯ + n C n a 0 b n
In compact sigma notation:
( a + b ) n = ∑ r = 0 n n C r a n − r b r (a+b)^n = \sum_{r=0}^{n} {}^n C_r a^{n-r} b^r ( a + b ) n = ∑ r = 0 n n C r a n − r b r
Fundamental Structural Properties
Total Number of Terms: The expansion contains exactly n + 1 n + 1 n + 1 terms.
Degree Homogeneity: In every term a n − r b r a^{n-r} b^r a n − r b r , the sum of the exponents of a a a and b b b is ( n − r ) + r = n (n-r) + r = n ( n − r ) + r = n .
Symmetry of Coefficients: Because n C r = n C n − r {}^n C_r = {}^n C_{n-r} n C r = n C n − r , coefficients equidistant from the beginning and end of the expansion are identical.
Sign Alternation: For ( a − b ) n (a - b)^n ( a − b ) n , terms alternate in sign: ( a − b ) n = ∑ r = 0 n ( − 1 ) r n C r a n − r b r (a-b)^n = \sum_{r=0}^{n} (-1)^r {}^n C_r a^{n-r} b^r ( a − b ) n = ∑ r = 0 n ( − 1 ) r n C r a n − r b r
3. The General Term ( T r + 1 T_{r+1} T r + 1 )
Because the expansion index r r r begins at 0, the ( r + 1 ) (r+1) ( r + 1 ) -th term of ( a + b ) n (a+b)^n ( a + b ) n is denoted as T r + 1 T_{r+1} T r + 1 :
T r + 1 = n C r a n − r b r T_{r+1} = {}^n C_r a^{n-r} b^r T r + 1 = n C r a n − r b r
Important Index Rule: The k k k -th term of the expansion corresponds to setting r = k − 1 r = k - 1 r = k − 1 .
1st term ( k = 1 k=1 k = 1 ): r = 0 ⟹ T 1 = n C 0 a n r = 0 \implies T_1 = {}^n C_0 a^n r = 0 ⟹ T 1 = n C 0 a n
5th term ( k = 5 k=5 k = 5 ): r = 4 ⟹ T 5 = n C 4 a n − 4 b 4 r = 4 \implies T_5 = {}^n C_4 a^{n-4} b^4 r = 4 ⟹ T 5 = n C 4 a n − 4 b 4
Last term ( k = n + 1 k=n+1 k = n + 1 ): r = n ⟹ T n + 1 = n C n b n r = n \implies T_{n+1} = {}^n C_n b^n r = n ⟹ T n + 1 = n C n b n
4. Middle Terms in the Expansion
The position of the middle term depends entirely on whether the exponent n n n is even or odd:
Case 1: When n n n is Even
The total number of terms is n + 1 n + 1 n + 1 , which is an odd integer.
Therefore, there is exactly one middle term .
Its position is the ( n 2 + 1 ) \left(\frac{n}{2} + 1\right) ( 2 n + 1 ) -th term (corresponding to index r = n 2 r = \frac{n}{2} r = 2 n ):
T middle = T n 2 + 1 = n C n / 2 a n / 2 b n / 2 T_{\text{middle}} = T_{\frac{n}{2}+1} = {}^n C_{n/2} a^{n/2} b^{n/2} T middle = T 2 n + 1 = n C n /2 a n /2 b n /2
Case 2: When n n n is Odd
The total number of terms is n + 1 n + 1 n + 1 , which is an even integer.
Therefore, there are two distinct middle terms .
Their positions are the ( n + 1 2 ) \left(\frac{n+1}{2}\right) ( 2 n + 1 ) -th term and the ( n + 3 2 ) \left(\frac{n+3}{2}\right) ( 2 n + 3 ) -th term:
T middle, 1 = T n − 1 2 + 1 = n C n − 1 2 a n + 1 2 b n − 1 2 T_{\text{middle, 1}} = T_{\frac{n-1}{2}+1} = {}^n C_{\frac{n-1}{2}} a^{\frac{n+1}{2}} b^{\frac{n-1}{2}} T middle, 1 = T 2 n − 1 + 1 = n C 2 n − 1 a 2 n + 1 b 2 n − 1
T middle, 2 = T n + 1 2 + 1 = n C n + 1 2 a n − 1 2 b n + 1 2 T_{\text{middle, 2}} = T_{\frac{n+1}{2}+1} = {}^n C_{\frac{n+1}{2}} a^{\frac{n-1}{2}} b^{\frac{n+1}{2}} T middle, 2 = T 2 n + 1 + 1 = n C 2 n + 1 a 2 n − 1 b 2 n + 1
5. Term Independent of x x x (Constant Term)
In expansions involving powers of a variable x x x , such as ( A x p + B x q ) n \left(A x^p + \frac{B}{x^q}\right)^n ( A x p + x q B ) n , questions frequently ask for the term independent of x x x (where the power of x x x is 0).
Systematic Solution Algorithm
Write the general term T r + 1 T_{r+1} T r + 1 : T r + 1 = n C r ( A x p ) n − r ( B x − q ) r = n C r A n − r B r x p ( n − r ) − q r T_{r+1} = {}^n C_r (A x^p)^{n-r} \left(B x^{-q}\right)^r = {}^n C_r A^{n-r} B^r x^{p(n-r) - qr} T r + 1 = n C r ( A x p ) n − r ( B x − q ) r = n C r A n − r B r x p ( n − r ) − q r
Collect all exponents of x x x into a single expression: E ( r ) = p ( n − r ) − q r = p n − ( p + q ) r E(r) = p(n-r) - qr = pn - (p+q)r E ( r ) = p ( n − r ) − q r = p n − ( p + q ) r
Set the net exponent equal to zero and solve for r r r : p n − ( p + q ) r = 0 ⟹ r = p n p + q pn - (p+q)r = 0 \implies r = \frac{pn}{p+q} p n − ( p + q ) r = 0 ⟹ r = p + q p n
Validity Check: The term independent of x x x exists if and only if r r r is an integer in the interval 0 ≤ r ≤ n 0 \le r \le n 0 ≤ r ≤ n . If r r r is fractional or negative, no constant term exists in the expansion (its coefficient is 0).
Substitute the resolved value of r r r back into the numerical coefficient of T r + 1 T_{r+1} T r + 1 .
6. Binomial Coefficient Identities
Let C r C_r C r denote n C r = ( n r ) {}^n C_r = \binom{n}{r} n C r = ( r n ) . Substituting specific values for a a a and b b b into ( a + b ) n (a+b)^n ( a + b ) n produces classic coefficient summation identities:
1. Sum of All Binomial Coefficients
Substitute a = 1 a = 1 a = 1 and b = 1 b = 1 b = 1 into ( a + b ) n (a+b)^n ( a + b ) n :
C 0 + C 1 + C 2 + ⋯ + C n = ( 1 + 1 ) n = 2 n C_0 + C_1 + C_2 + \dots + C_n = (1+1)^n = 2^n C 0 + C 1 + C 2 + ⋯ + C n = ( 1 + 1 ) n = 2 n
2. Alternating Sum of Binomial Coefficients
Substitute a = 1 a = 1 a = 1 and b = − 1 b = -1 b = − 1 into ( a + b ) n (a+b)^n ( a + b ) n :
C 0 − C 1 + C 2 − C 3 + ⋯ + ( − 1 ) n C n = ( 1 − 1 ) n = 0 C_0 - C_1 + C_2 - C_3 + \dots + (-1)^n C_n = (1-1)^n = 0 C 0 − C 1 + C 2 − C 3 + ⋯ + ( − 1 ) n C n = ( 1 − 1 ) n = 0
3. Sum of Even and Odd Coefficients
From the two equations above, adding and subtracting yields:
C 0 + C 2 + C 4 + ⋯ = C 1 + C 3 + C 5 + ⋯ = 2 n − 1 C_0 + C_2 + C_4 + \dots = C_1 + C_3 + C_5 + \dots = 2^{n-1} C 0 + C 2 + C 4 + ⋯ = C 1 + C 3 + C 5 + ⋯ = 2 n − 1
4. Advanced Coefficient Summations
First derivative identity: ∑ r = 1 n r C r = 1 C 1 + 2 C 2 + 3 C 3 + ⋯ + n C n = n 2 n − 1 \sum_{r=1}^n r C_r = 1 C_1 + 2 C_2 + 3 C_3 + \dots + n C_n = n 2^{n-1} ∑ r = 1 n r C r = 1 C 1 + 2 C 2 + 3 C 3 + ⋯ + n C n = n 2 n − 1
Sum of squares of coefficients: ∑ r = 0 n C r 2 = C 0 2 + C 1 2 + C 2 2 + ⋯ + C n 2 = 2 n C n = ( 2 n ) ! ( n ! ) 2 \sum_{r=0}^n C_r^2 = C_0^2 + C_1^2 + C_2^2 + \dots + C_n^2 = {}^{2n} C_n = \frac{(2n)!}{(n!)^2} ∑ r = 0 n C r 2 = C 0 2 + C 1 2 + C 2 2 + ⋯ + C n 2 = 2 n C n = ( n ! ) 2 ( 2 n )!
7. Binomial Theorem for Any Rational Index ( n ∈ Q n \in \mathbb{Q} n ∈ Q )
When the exponent n n n is a negative integer or a non-integer fraction ( n ∉ N n \notin \mathbb{N} n ∈ / N ), the expansion of ( 1 + x ) n (1+x)^n ( 1 + x ) n requires a modified formulation.
Infinite Series Formulation
For any rational number n n n and any real x x x satisfying ∣ x ∣ < 1 |x| < 1 ∣ x ∣ < 1 :
( 1 + x ) n = 1 + n x + n ( n − 1 ) 2 ! x 2 + n ( n − 1 ) ( n − 2 ) 3 ! x 3 + ⋯ + n ( n − 1 ) … ( n − r + 1 ) r ! x r + … (1+x)^n = 1 + nx + \frac{n(n-1)}{2!} x^2 + \frac{n(n-1)(n-2)}{3!} x^3 + \dots + \frac{n(n-1)\dots(n-r+1)}{r!} x^r + \dots ( 1 + x ) n = 1 + n x + 2 ! n ( n − 1 ) x 2 + 3 ! n ( n − 1 ) ( n − 2 ) x 3 + ⋯ + r ! n ( n − 1 ) … ( n − r + 1 ) x r + …
Fundamental Differences from the Positive Integral Theorem:
Infinite Number of Terms: Because n n n is not a positive integer, the factor ( n − r + 1 ) (n - r + 1) ( n − r + 1 ) never equals zero. The series contains infinitely many terms.
Strict Convergence Constraint: The series converges if and only if ∣ x ∣ < 1 |x| < 1 ∣ x ∣ < 1 (i.e., − 1 < x < 1 -1 < x < 1 − 1 < x < 1 ). If ∣ x ∣ ≥ 1 |x| \ge 1 ∣ x ∣ ≥ 1 , the series diverges and cannot be evaluated.
Base Normalization Requirement: To expand an expression such as ( a + b ) n (a + b)^n ( a + b ) n where n ∉ N n \notin \mathbb{N} n ∈ / N , factor out a n a^n a n to form a n ( 1 + b a ) n a^n \left(1 + \frac{b}{a}\right)^n a n ( 1 + a b ) n , requiring ∣ b a ∣ < 1 \left|\frac{b}{a}\right| < 1 a b < 1 .
Canonical Infinite Series to Memorize:
( 1 − x ) − 1 = 1 + x + x 2 + x 3 + … ( ∣ x ∣ < 1 ) (1-x)^{-1} = 1 + x + x^2 + x^3 + \dots \quad (|x| < 1) ( 1 − x ) − 1 = 1 + x + x 2 + x 3 + … ( ∣ x ∣ < 1 )
( 1 + x ) − 1 = 1 − x + x 2 − x 3 + … ( ∣ x ∣ < 1 ) (1+x)^{-1} = 1 - x + x^2 - x^3 + \dots \quad (|x| < 1) ( 1 + x ) − 1 = 1 − x + x 2 − x 3 + … ( ∣ x ∣ < 1 )
( 1 − x ) − 2 = 1 + 2 x + 3 x 2 + 4 x 3 + … ( ∣ x ∣ < 1 ) (1-x)^{-2} = 1 + 2x + 3x^2 + 4x^3 + \dots \quad (|x| < 1) ( 1 − x ) − 2 = 1 + 2 x + 3 x 2 + 4 x 3 + … ( ∣ x ∣ < 1 )
( 1 + x ) − 2 = 1 − 2 x + 3 x 2 − 4 x 3 + … ( ∣ x ∣ < 1 ) (1+x)^{-2} = 1 - 2x + 3x^2 - 4x^3 + \dots \quad (|x| < 1) ( 1 + x ) − 2 = 1 − 2 x + 3 x 2 − 4 x 3 + … ( ∣ x ∣ < 1 )
( 1 + x ) 1 / 2 = 1 + 1 2 x − 1 8 x 2 + 1 16 x 3 − … ( ∣ x ∣ < 1 ) (1+x)^{1/2} = 1 + \frac{1}{2}x - \frac{1}{8}x^2 + \frac{1}{16}x^3 - \dots \quad (|x| < 1) ( 1 + x ) 1/2 = 1 + 2 1 x − 8 1 x 2 + 16 1 x 3 − … ( ∣ x ∣ < 1 )
Rapid Decimal Approximation Shortcut
When x x x is very small compared to 1 ( ∣ x ∣ ≪ 1 |x| \ll 1 ∣ x ∣ ≪ 1 ), higher powers of x x x become negligible, allowing the linear approximation:
( 1 + x ) n ≈ 1 + n x (1+x)^n \approx 1 + nx ( 1 + x ) n ≈ 1 + n x
Example: Approximate 1.04 = ( 1 + 0.04 ) 1 / 2 \sqrt{1.04} = (1 + 0.04)^{1/2} 1.04 = ( 1 + 0.04 ) 1/2 :
1.04 ≈ 1 + 1 2 ( 0.04 ) = 1 + 0.02 = 1.02 \sqrt{1.04} \approx 1 + \frac{1}{2}(0.04) = 1 + 0.02 = 1.02 1.04 ≈ 1 + 2 1 ( 0.04 ) = 1 + 0.02 = 1.02
8. Summary Comparison: Positive Integral vs. Rational Index
Feature Positive Integer Index ( n ∈ N n \in \mathbb{N} n ∈ N ) Negative or Fractional Rational Index ( n ∈ Q ∖ N n \in \mathbb{Q} \setminus \mathbb{N} n ∈ Q ∖ N )
Number of Terms Exactly n + 1 n + 1 n + 1 (finite) Infinitely many terms
Convergence Domain Converges for all x ∈ R x \in \mathbb{R} x ∈ R Converges strictly for ∣ x ∣ < 1 \lvert x \rvert < 1 ∣ x ∣ < 1
General Term ( T r + 1 T_{r+1} T r + 1 ) n C r a n − r b r {}^n C_r a^{n-r} b^r n C r a n − r b r n ( n − 1 ) ( n − 2 ) … ( n − r + 1 ) r ! x r \frac{n(n-1)(n-2)\dots(n-r+1)}{r!} x^r r ! n ( n − 1 ) ( n − 2 ) … ( n − r + 1 ) x r
Combinatorial Notation Representable with n C r {}^n C_r n C r Cannot use n C r {}^n C_r n C r (factorials undefined for rationals)