Study guide

18.2 Binomial Theorem, Pascal's Triangle & General Term Determination

FTCE Mathematics 6-12 026

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Overview & Rational Number Systems

1.1 FTCE Mathematics 6-12 Overview, Interface & Test-Taking Strategies 1.2 Rational Numbers, Representations & Multi-Step Operations

2 Chapter 2: Real Number Approximations & Proportional Reasoning

2.1 Irrational Numbers, Radical Estimation & Scientific Notation 2.2 Ratios, Rates, Proportions & Dimensional Analysis 2.3 Percent Applications, Financial Models & Depreciation

3 Chapter 3: Algebraic Expressions & Polynomial Operations

3.1 Polynomial Arithmetic, Factoring Strategies & Special Products 3.2 Radical Operations, Rational Expressions & Equations 3.3 Field Properties, Exponent Laws & Literal Equations

4 Chapter 4: Linear Relationships, Systems & Inequalities

4.1 Linear Equations, Slope Concepts & Line Forms 4.2 Systems of Linear Equations & Real-World Applications 4.3 Single & Systems of Linear Inequalities on the Coordinate Plane 4.4 Absolute Value Equations & Inequalities in One and Two Variables

5 Chapter 5: Quadratic Equations, Functions & Complex Numbers

5.1 Quadratic Equations, Discriminant & Complex Number Arithmetic 5.2 Quadratic Functions: Vertex, Axis, Intercepts & Concavity 5.3 Quadratic Inequalities in One/Two Variables & Optimization

6 Chapter 6: Function Foundations, Transformations & Inverses

6.1 Function Definitions, Relations, Domain, Range & Notation 6.2 Function Families, Key Graphical Behaviors & Even/Odd Symmetry 6.3 Shifting, Scaling & Reflecting Functions Across Representations 6.4 Function Composition, Invertibility & Inverse Functions

7 Chapter 7: Geometric Foundations, Angles & Deductive Proofs

7.1 Angle Relationships, Parallel Lines & Transversals 7.2 Triangle Sum, Exterior Angles & Polygon Angle Formulas 7.3 Formal Proof Methods, CPCTC & Quadrilateral Properties

8 Chapter 8: Congruence, Similarity & Geometric Transformations

8.1 Triangle Congruence (SSS, SAS, ASA, AAS, HL) & Similarity (AA, SAS, SSS) 8.2 Rigid Motions: Translations, Reflections, Rotations & Symmetry 8.3 Dilations, Scale Factors & Proportional Reasoning in Geometry

9 Chapter 9: Coordinate Geometry & 3D Spatial Measurement

9.1 Distance, Midpoint, Slope Criteria & Coordinate Proofs 9.2 Perimeter, Area, Surface Area & Volume of 2D and 3D Figures 9.3 Cross Sections of 3D Figures & Solids of Revolution

10 Chapter 10: Circle Theorems & Geometric Constructions

10.1 Central, Inscribed, Tangent & Chord Angles and Arcs 10.2 Intersecting Chords, Secant/Tangent Lengths, Arc Length & Sector Area 10.3 Euclidean Constructions with Compass and Straightedge

11 Chapter 11: Conic Sections & Coordinate Modeling

11.1 Circles and Parabolas: Geometric Definitions, Equations & Modeling 11.2 Ellipses and Hyperbolas: Foci, Axes, Asymptotes & Real-World Applications

12 Chapter 12: Trigonometric Foundations & Oblique Triangles

12.1 Right-Triangle Trigonometry, Pythagorean Theorem & Special Triangles 12.2 The Unit Circle, Radian Measure & Exact Trigonometric Values 12.3 Law of Sines (Ambiguous Case), Law of Cosines & Oblique Triangle Area

13 Chapter 13: Trigonometric Functions, Polar & Parametric Systems

13.1 Graphs of the Six Trigonometric Functions & Periodic Modeling 13.2 Polar Coordinates, Polar-Rectangular Conversion & Polar Graphs 13.3 Parametric Equations, Elimination of Parameters & Projectile Motion

14 Chapter 14: Descriptive Statistics & Data Distributions

14.1 Measures of Central Tendency, Dispersion & Resistant Statistics 14.2 Univariate Displays (Histograms, Boxplots, Stemplots) & Distribution Shapes 14.3 Normal Distribution Properties, Empirical Rule & Standard Normal Z-Scores

15 Chapter 15: Statistical Studies, Bivariate Data & Linear Regression

15.1 Statistical Study Design, Random Sampling Techniques & Sources of Bias 15.2 Survey Sampling, Margin of Error & Population Estimation 15.3 Scatterplots, Correlation Coefficient r, Linear Regression & Residuals

16 Chapter 16: Probability Theory, Two-Way Tables & Expected Value

16.1 Fundamental Counting Principle, Permutations & Combinations 16.2 Addition Rule, Multiplication Rule, Independent Events & Conditional Probability 16.3 Two-Way Frequency Tables, Law of Large Numbers & Expected Value of Random Variables

17 Chapter 17: Precalculus: Polynomial, Rational & Transcendental Functions

17.1 Fundamental Theorem of Algebra, Remainder/Factor Theorems & Polynomial Roots 17.2 Rational Functions, Domain Restrictions, Holes & Asymptotes 17.3 Exponential & Logarithmic Functions, Base e & Logarithmic Properties

18 Chapter 18: Sequences, Series, Binomial Theorem & Vectors

18.1 Arithmetic & Geometric Sequences, Finite Sums & Infinite Series Convergence 18.2 Binomial Theorem, Pascal's Triangle & General Term Determination 18.3 Vector Representations, Operations, Magnitude, Direction & Dot Product

19 Chapter 19: Differential Calculus Foundations

19.1 Limits, One-Sided Limits, Indeterminate Forms & Continuity 19.2 Derivative Definition, Power, Product, Quotient & Transcendental Rules 19.3 Chain Rule, Tangent Line Equations & Rates of Change

20 Chapter 20: Applications of Derivatives & Integral Calculus

20.1 First & Second Derivative Tests, Extrema, Concavity & Optimization 20.2 Antiderivatives, Indefinite Integrals & Integration by U-Substitution 20.3 Fundamental Theorem of Calculus, Net Signed Area & Geometric Applications

21 Chapter 21: Mathematical Representations, Progressions & Tools

21.1 Concrete-Representational-Abstract (CPA) Progressions & Concept Continuity 21.2 The Rule of Four: Translating Among Representations to Support Fluency 21.3 Manipulatives, Dynamic Software & Technology in Secondary Mathematics

22 Chapter 22: Assessment, Error Analysis & Misconception Remediation

22.1 Student Misconceptions & Error Analysis Across Core Secondary Domains 22.2 Evaluating Validity of Student Mathematical Arguments & Reasonableness Checks 22.3 Formative Assessment Formats, Data-Driven Differentiation & Tiered Tasks

18.2 Binomial Theorem, Pascal's Triangle & General Term Determination

Key Takeaways Explain This Topic AI

The Binomial Theorem states that ( a + b ) n = ∑ k = 0 n ( n k ) a n − k b k (a + b)^n = \sum_{k=0}^n \binom{n}{k} a^{n-k} b^k ( a + b ) n = ∑ k = 0 n ​ ( k n ​ ) a n − k b k , expanding into exactly n + 1 n + 1 n + 1 terms where the sum of powers in each term is n n n .

Binomial coefficients ( n k ) = n ! k ! ( n − k ) ! \binom{n}{k} = \frac{n!}{k!(n - k)!} ( k n ​ ) = k ! ( n − k )! n ! ​ correspond to row n n n of Pascal's Triangle, governed by Pascal's Identity ( n k ) = ( n − 1 k − 1 ) + ( n − 1 k ) \binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k} ( k n ​ ) = ( k − 1 n − 1 ​ ) + ( k n − 1 ​ ) and symmetry ( n k ) = ( n n − k ) \binom{n}{k} = \binom{n}{n-k} ( k n ​ ) = ( n − k n ​ ) .

The general ( k + 1 ) (k+1) ( k + 1 ) -th term formula T k + 1 = ( n k ) a n − k b k T_{k+1} = \binom{n}{k} a^{n-k} b^k T k + 1 ​ = ( k n ​ ) a n − k b k indexes terms starting from k = 0 k = 0 k = 0 ; finding the m m m -th term requires setting k = m − 1 k = m - 1 k = m − 1 .

To find constant terms or specific power coefficients in rational binomials ( A x p + B x − q ) n \left(A x^p + B x^{-q}\right)^n ( A x p + B x − q ) n , express exponents as a linear equation in k k k and solve for the integer index k ∈ { 0 , 1 , … , n } k \in \{0, 1, \dots, n\} k ∈ { 0 , 1 , … , n } .

The sum of all coefficients in ( a x + b y ) n (a x + b y)^n ( a x + b y ) n is evaluated instantaneously by substituting x = 1 x = 1 x = 1 and y = 1 y = 1 y = 1 , yielding ( a + b ) n (a + b)^n ( a + b ) n .

Last updated: September 2026

  • 18.2 Binomial Theorem, Pascal's Triangle & General Term Determination
  • Combinatorial Foundations: Combinations & Factorial Notation

The algebraic expansion of polynomial powers is intimately connected to combinatorics. The number of distinct subsets of size k k k that can be selected from an n n n -element set without regard to order is given by the combination formula, denoted ( n k ) \binom{n}{k} ( k n ​ ) (read ' n n n choose k k k ') or n C k {}_nC_k n ​ C k ​ : ( n k ) = n ! k ! ( n − k ) ! for 0 ≤ k ≤ n \binom{n}{k} = \frac{n!}{k!(n - k)!} \quad \text{for } 0 \le k \le n ( k n ​ ) = k ! ( n − k )! n ! ​ for 0 ≤ k ≤ n

where n ! = n × ( n − 1 ) × ⋯ × 2 × 1 n! = n \times (n - 1) \times \dots \times 2 \times 1 n ! = n × ( n − 1 ) × ⋯ × 2 × 1 , with the fundamental convention 0 ! = 1 0! = 1 0 ! = 1 . The combination values satisfy two structural algebraic properties:

Combinatorial Symmetry: Selecting k k k items to include is equivalent to selecting n − k n - k n − k items to exclude: ( n k ) = ( n n − k ) \binom{n}{k} = \binom{n}{n - k} ( k n ​ ) = ( n − k n ​ )

Boundary Values: For any non-negative integer n n n , ( n 0 ) = 1 \binom{n}{0} = 1 ( 0 n ​ ) = 1 and ( n n ) = 1 \binom{n}{n} = 1 ( n n ​ ) = 1 .

Pascal's Triangle & Pascal's Identity

When combinations are arranged sequentially by row n n n and entry k k k , they form Pascal's Triangle . The generating mechanism that produces each interior entry by adding the two adjacent numbers directly above it is formalized as Pascal's Identity : ( n k ) = ( n − 1 k − 1 ) + ( n − 1 k ) for 1 ≤ k ≤ n − 1 \binom{n}{k} = \binom{n - 1}{k - 1} + \binom{n - 1}{k} \quad \text{for } 1 \le k \le n - 1 ( k n ​ ) = ( k − 1 n − 1 ​ ) + ( k n − 1 ​ ) for 1 ≤ k ≤ n − 1

Algebraic proof of Pascal's Identity verifies this relationship: ( n − 1 ) ! ( k − 1 ) ! ( n − k ) ! + ( n − 1 ) ! k ! ( n − 1 − k ) ! = ( n − 1 ) ! ⋅ k k ! ( n − k ) ! + ( n − 1 ) ! ⋅ ( n − k ) k ! ( n − k ) ! = ( n − 1 ) ! [ k + n − k ] k ! ( n − k ) ! = n ! k ! ( n − k ) ! = ( n k ) \frac{(n-1)!}{(k-1)!(n-k)!} + \frac{(n-1)!}{k!(n-1-k)!} = \frac{(n-1)! \cdot k}{k!(n-k)!} + \frac{(n-1)! \cdot (n-k)}{k!(n-k)!} = \frac{(n-1)![k + n - k]}{k!(n-k)!} = \frac{n!}{k!(n-k)!} = \binom{n}{k} ( k − 1 )! ( n − k )! ( n − 1 )! ​ + k ! ( n − 1 − k )! ( n − 1 )! ​ = k ! ( n − k )! ( n − 1 )! ⋅ k ​ + k ! ( n − k )! ( n − 1 )! ⋅ ( n − k ) ​ = k ! ( n − k )! ( n − 1 )! [ k + n − k ] ​ = k ! ( n − k )! n ! ​ = ( k n ​ )

Key geometric and algebraic invariants of Pascal's Triangle include:

Row Sums: The sum of entries in row n n n equals 2 n 2^n 2 n : ∑ k = 0 n ( n k ) = 2 n \sum_{k=0}^n \binom{n}{k} = 2^n ∑ k = 0 n ​ ( k n ​ ) = 2 n . This represents the total number of subsets of an n n n -element set (the cardinality of the power set).

Alternating Row Sums: For any row n ≥ 1 n \ge 1 n ≥ 1 , the alternating sum of entries is identically zero: ∑ k = 0 n ( − 1 ) k ( n k ) = 0 \sum_{k=0}^n (-1)^k \binom{n}{k} = 0 ∑ k = 0 n ​ ( − 1 ) k ( k n ​ ) = 0 .

The Binomial Theorem: Formulation & Properties

For any real or complex numbers a a a and b b b and any non-negative integer n n n , the Binomial Theorem provides the closed-form expansion of ( a + b ) n (a + b)^n ( a + b ) n : ( a + b ) n = ∑ k = 0 n ( n k ) a n − k b k = ( n 0 ) a n + ( n 1 ) a n − 1 b + ( n 2 ) a n − 2 b 2 + ⋯ + ( n n ) b n (a + b)^n = \sum_{k=0}^n \binom{n}{k} a^{n-k} b^k = \binom{n}{0}a^n + \binom{n}{1}a^{n-1}b + \binom{n}{2}a^{n-2}b^2 + \dots + \binom{n}{n}b^n ( a + b ) n = k = 0 ∑ n ​ ( k n ​ ) a n − k b k = ( 0 n ​ ) a n + ( 1 n ​ ) a n − 1 b + ( 2 n ​ ) a n − 2 b 2 + ⋯ + ( n n ​ ) b n

Expansion properties tested on the FTCE examination include:

Term Count: The complete expansion contains exactly n + 1 n + 1 n + 1 terms.

Homogeneous Total Degree: The sum of exponents of a a a and b b b in every individual term is constant: ( n − k ) + k = n (n - k) + k = n ( n − k ) + k = n .

Sum of All Coefficients: Setting all variable terms to 1 evaluates the sum of coefficients instantaneously: substituting x = 1 , y = 1 x = 1, y = 1 x = 1 , y = 1 into ( c 1 x + c 2 y ) n (c_1 x + c_2 y)^n ( c 1 ​ x + c 2 ​ y ) n yields ( c 1 + c 2 ) n (c_1 + c_2)^n ( c 1 ​ + c 2 ​ ) n .

The General ( k + 1 ) (k+1) ( k + 1 ) -th Term Formula

Because the summation index starts at k = 0 k = 0 k = 0 , the terms are indexed sequentially:

1 1 1 st term ( k = 0 k = 0 k = 0 ): T 1 = ( n 0 ) a n b 0 T_1 = \binom{n}{0} a^n b^0 T 1 ​ = ( 0 n ​ ) a n b 0

2 2 2 nd term ( k = 1 k = 1 k = 1 ): T 2 = ( n 1 ) a n − 1 b 1 T_2 = \binom{n}{1} a^{n-1} b^1 T 2 ​ = ( 1 n ​ ) a n − 1 b 1

In general, the ( k + 1 ) (k+1) ( k + 1 ) -th term is given by: T k + 1 = ( n k ) a n − k b k T_{k+1} = \binom{n}{k} a^{n-k} b^k T k + 1 ​ = ( k n ​ ) a n − k b k

A ubiquitous candidate error is confusing the term order m m m with the index parameter k k k . To find the 6th term, one must set k = 6 − 1 = 5 k = 6 - 1 = 5 k = 6 − 1 = 5 , not k = 6 k = 6 k = 6 .

When expressions involve negative signs, fractions, or algebraic powers, each component must be partitioned carefully into its numerical coefficient and variable exponent: ( A x p + B x − q ) n ⟹ T k + 1 = ( n k ) ( A x p ) n − k ( B x − q ) k = ( n k ) A n − k B k x p ( n − k ) − q k \left(A x^p + B x^{-q}\right)^n \implies T_{k+1} = \binom{n}{k} (A x^p)^{n-k} (B x^{-q})^k = \binom{n}{k} A^{n-k} B^k x^{p(n-k) - q k} ( A x p + B x − q ) n ⟹ T k + 1 ​ = ( k n ​ ) ( A x p ) n − k ( B x − q ) k = ( k n ​ ) A n − k B k x p ( n − k ) − q k

Finding Specific Terms & Constant Terms

To identify a term possessing a specific power of x x x (such as x m x^m x m , or the constant term where x 0 = 1 x^0 = 1 x 0 = 1 ):

Write out the general term T k + 1 T_{k+1} T k + 1 ​ with explicit powers.

Collect the variable exponents into a single linear equation in k k k : p ( n − k ) − q k = m p(n - k) - q k = m p ( n − k ) − q k = m .

Solve for k k k . If k k k is an integer in the domain 0 ≤ k ≤ n 0 \le k \le n 0 ≤ k ≤ n , the term exists; if k k k is fractional or outside the domain, the coefficient of that power is 0.

Substitute the solved integer k k k back into the coefficient expression ( n k ) A n − k B k \binom{n}{k} A^{n-k} B^k ( k n ​ ) A n − k B k to evaluate the exact numerical value.

Combinatorics & the Binomial Probability Distribution

The Binomial Theorem provides the mathematical foundation for the binomial probability distribution . In an experiment consisting of n n n independent and identical Bernoulli trials, where each trial results in either 'success' with probability p p p or 'failure' with probability q = 1 − p q = 1 - p q = 1 − p , the probability of obtaining exactly k k k successes is given by: P ( X = k ) = ( n k ) p k ( 1 − p ) n − k for k ∈ { 0 , 1 , 2 , … , n } P(X = k) = \binom{n}{k} p^k (1 - p)^{n-k} \quad \text{for } k \in \{0, 1, 2, \dots, n\} P ( X = k ) = ( k n ​ ) p k ( 1 − p ) n − k for k ∈ { 0 , 1 , 2 , … , n }

The total probability across all possible outcomes sums to 1 as an immediate consequence of the Binomial Theorem: ∑ k = 0 n P ( X = k ) = ∑ k = 0 n ( n k ) p k ( 1 − p ) n − k = ( p + ( 1 − p ) ) n = 1 n = 1 \sum_{k=0}^n P(X = k) = \sum_{k=0}^n \binom{n}{k} p^k (1 - p)^{n-k} = (p + (1 - p))^n = 1^n = 1 k = 0 ∑ n ​ P ( X = k ) = k = 0 ∑ n ​ ( k n ​ ) p k ( 1 − p ) n − k = ( p + ( 1 − p ) ) n = 1 n = 1

Pascal's Triangle & Binomial Coefficients Table

  • Row ( n n n ) Binomial Expansion Row Coefficients ( n k ) \binom{n}{k} ( k n ​ ) Row Sum ( 2 n 2^n 2 n )
  • 0 ( a + b ) 0 (a + b)^0 ( a + b ) 0 1 1 1 2 0 = 1 2^0 = 1 2 0 = 1
  • 1 ( a + b ) 1 (a + b)^1 ( a + b ) 1 1 , 1 1,\; 1 1 , 1 2 1 = 2 2^1 = 2 2 1 = 2
  • 2 ( a + b ) 2 (a + b)^2 ( a + b ) 2 1 , 2 , 1 1,\; 2,\; 1 1 , 2 , 1 2 2 = 4 2^2 = 4 2 2 = 4
  • 3 ( a + b ) 3 (a + b)^3 ( a + b ) 3 1 , 3 , 3 , 1 1,\; 3,\; 3,\; 1 1 , 3 , 3 , 1 2 3 = 8 2^3 = 8 2 3 = 8

4 ( a + b ) 4 (a + b)^4 ( a + b ) 4 1 , 4 , 6 , 4 , 1 1,\; 4,\; 6,\; 4,\; 1 1 , 4 , 6 , 4 , 1 2 4 = 16 2^4 = 16 2 4 = 16

5 ( a + b ) 5 (a + b)^5 ( a + b ) 5 1 , 5 , 10 , 10 , 5 , 1 1,\; 5,\; 10,\; 10,\; 5,\; 1 1 , 5 , 10 , 10 , 5 , 1 2 5 = 32 2^5 = 32 2 5 = 32

6 ( a + b ) 6 (a + b)^6 ( a + b ) 6 1 , 6 , 15 , 20 , 15 , 6 , 1 1,\; 6,\; 15,\; 20,\; 15,\; 6,\; 1 1 , 6 , 15 , 20 , 15 , 6 , 1 2 6 = 64 2^6 = 64 2 6 = 64

Worked Exemplar: Determining Specific Terms in a Rational Expansion

Problem: Consider the binomial expansion of ( 2 x 2 − 3 x ) 9 \left(2x^2 - \frac{3}{x}\right)^9 ( 2 x 2 − x 3 ​ ) 9 .

Determine the term independent of x x x (the constant term).

Determine the coefficient of x 6 x^6 x 6 .

Step 1: Set Up the General Term Formula. Identify a = 2 x 2 a = 2x^2 a = 2 x 2 , b = − 3 x − 1 b = -3x^{-1} b = − 3 x − 1 , and n = 9 n = 9 n = 9 . The general ( k + 1 ) (k+1) ( k + 1 ) -th term is: T k + 1 = ( 9 k ) ( 2 x 2 ) 9 − k ( − 3 x ) k = ( 9 k ) 2 9 − k ( x 2 ) 9 − k ( − 3 ) k ( x − 1 ) k T_{k+1} = \binom{9}{k} (2x^2)^{9-k} \left(-\frac{3}{x}\right)^k = \binom{9}{k} 2^{9-k} (x^2)^{9-k} (-3)^k (x^{-1})^k T k + 1 ​ = ( k 9 ​ ) ( 2 x 2 ) 9 − k ( − x 3 ​ ) k = ( k 9 ​ ) 2 9 − k ( x 2 ) 9 − k ( − 3 ) k ( x − 1 ) k

Separate the numerical and variable factors: T k + 1 = ( 9 k ) 2 9 − k ( − 3 ) k x 2 ( 9 − k ) − k = ( 9 k ) 2 9 − k ( − 3 ) k x 18 − 3 k T_{k+1} = \binom{9}{k} 2^{9-k} (-3)^k x^{2(9-k) - k} = \binom{9}{k} 2^{9-k} (-3)^k x^{18 - 3k} T k + 1 ​ = ( k 9 ​ ) 2 9 − k ( − 3 ) k x 2 ( 9 − k ) − k = ( k 9 ​ ) 2 9 − k ( − 3 ) k x 18 − 3 k

Step 2: Solve for the Constant Term ( x 0 x^0 x 0 ). The constant term corresponds to an exponent of zero on x x x : 18 − 3 k = 0 ⟹ 3 k = 18 ⟹ k = 6 18 - 3k = 0 \implies 3k = 18 \implies k = 6 18 − 3 k = 0 ⟹ 3 k = 18 ⟹ k = 6

Because k = 6 k = 6 k = 6 is an integer satisfying 0 ≤ 6 ≤ 9 0 \le 6 \le 9 0 ≤ 6 ≤ 9 , the constant term exists and corresponds to the ( 6 + 1 ) = 7 th (6 + 1) = 7\text{th} ( 6 + 1 ) = 7 th term ( T 7 T_7 T 7 ​ ). Evaluate the coefficient: Constant Term = ( 9 6 ) 2 9 − 6 ( − 3 ) 6 = ( 9 3 ) 2 3 ( − 3 ) 6 \text{Constant Term} = \binom{9}{6} 2^{9-6} (-3)^6 = \binom{9}{3} 2^3 (-3)^6 Constant Term = ( 6 9 ​ ) 2 9 − 6 ( − 3 ) 6 = ( 3 9 ​ ) 2 3 ( − 3 ) 6

Compute each component: ( 9 3 ) = 9 × 8 × 7 3 × 2 × 1 = 84 \binom{9}{3} = \frac{9 \times 8 \times 7}{3 \times 2 \times 1} = 84 ( 3 9 ​ ) = 3 × 2 × 1 9 × 8 × 7 ​ = 84 2 3 = 8 , ( − 3 ) 6 = 729 2^3 = 8, \quad (-3)^6 = 729 2 3 = 8 , ( − 3 ) 6 = 729 Constant Term = 84 × 8 × 729 = 672 × 729 = 489 , 888 \text{Constant Term} = 84 \times 8 \times 729 = 672 \times 729 = 489,888 Constant Term = 84 × 8 × 729 = 672 × 729 = 489 , 888

Step 3: Solve for the Coefficient of x 6 x^6 x 6 . Set the variable exponent equal to 6: 18 − 3 k = 6 ⟹ 3 k = 12 ⟹ k = 4 18 - 3k = 6 \implies 3k = 12 \implies k = 4 18 − 3 k = 6 ⟹ 3 k = 12 ⟹ k = 4

This corresponds to the 5th term ( T 5 T_5 T 5 ​ ). Evaluate the coefficient: Coefficient of x 6 = ( 9 4 ) 2 9 − 4 ( − 3 ) 4 = ( 9 4 ) 2 5 ( − 3 ) 4 \text{Coefficient of } x^6 = \binom{9}{4} 2^{9-4} (-3)^4 = \binom{9}{4} 2^5 (-3)^4 Coefficient of x 6 = ( 4 9 ​ ) 2 9 − 4 ( − 3 ) 4 = ( 4 9 ​ ) 2 5 ( − 3 ) 4

Compute each component: ( 9 4 ) = 9 × 8 × 7 × 6 4 × 3 × 2 × 1 = 126 \binom{9}{4} = \frac{9 \times 8 \times 7 \times 6}{4 \times 3 \times 2 \times 1} = 126 ( 4 9 ​ ) = 4 × 3 × 2 × 1 9 × 8 × 7 × 6 ​ = 126 2 5 = 32 , ( − 3 ) 4 = 81 2^5 = 32, \quad (-3)^4 = 81 2 5 = 32 , ( − 3 ) 4 = 81 Coefficient of x 6 = 126 × 32 × 81 = 4 , 032 × 81 = 326 , 592 \text{Coefficient of } x^6 = 126 \times 32 \times 81 = 4,032 \times 81 = 326,592 Coefficient of x 6 = 126 × 32 × 81 = 4 , 032 × 81 = 326 , 592

Both specific terms are completely determined.