Carry out Binomial Expansion is a fundamental skill for civil engineers working on structural calculations, load estimations, and material strength analyses. Understanding the Binomial Theorem and its coefficients enables precise polynomial expansions without lengthy multiplication, which saves time and reduces errors in design computations. This chapter focuses on the mathematical techniques of binomial expansion tailored for practical civil engineering applications in Kenya.

3.1 Binomial Theorem

The Binomial Theorem provides a formula to expand powers of binomials such as (a + b)ⁿ efficiently. In civil engineering calculations, this theorem is essential when dealing with polynomial expressions arising from load combinations, structural deflections, or material properties. The theorem states that any binomial raised to a positive integer power can be expanded into a sum involving binomial coefficients.

3.1.1 Expansion of (a + b) n using the binomial theorem

The Binomial Theorem expresses the expansion of (a + b)ⁿ where n is a non-negative integer. Instead of multiplying (a + b) by itself n times, the theorem writes the result directly as n + 1 terms, in which the power of a falls from n to 0 while the power of b rises from 0 to n, each term multiplied by a binomial coefficient. Example: an engineer modelling a cubic deflection expression (x + 2)³ for a footbridge at a game lodge expands it in one step rather than by repeated multiplication.

The binomial theorem

(a + b)ⁿ = C(n, 0)aⁿ + C(n, 1)aⁿ⁻¹b + C(n, 2)aⁿ⁻²b² + ... + C(n, n)bⁿ

General term (the (k + 1)th term): Tₖ₊₁ = C(n, k) × aⁿ⁻ᵏ × bᵏ

Features of the expansion

• Number of terms: The expansion of (a + b)ⁿ has n + 1 terms.
• Powers of a: Start at n and decrease by 1 in each term down to 0.
• Powers of b: Start at 0 and increase by 1 in each term up to n.
• Sum of powers: In every term the powers of a and b add up to n.
• Signs: When b is negative, the terms alternate in sign, starting positive.

Steps in expanding (a + b)ⁿ

1. Identify a, b and n: Include any sign or coefficient in b, such as b = −3x.
2. Find the coefficients: Use C(n, k) or the nth row of Pascal's triangle.
3. Write the powers of a: From aⁿ down to a⁰.
4. Write the powers of b: From b⁰ up to bⁿ.
5. Multiply each set: Coefficient × power of a × power of b.
6. Simplify each term: Evaluate the numbers and signs.
7. Check: Confirm there are n + 1 terms and the powers add to n.

Worked Examples

Example 1: Expand (x + 2)³

a = x, b = 2, n = 3; coefficients 1, 3, 3, 1

= 1 × x³ × 2⁰ + 3 × x² × 2¹ + 3 × x × 2² + 1 × x⁰ × 2³

Answer: x³ + 6x² + 12x + 8

Example 2: Expand (3 + y)⁴

a = 3, b = y, n = 4; coefficients 1, 4, 6, 4, 1

= 1 × 3⁴ + 4 × 3³ × y + 6 × 3² × y² + 4 × 3 × y³ + 1 × y⁴

Answer: 81 + 108y + 54y² + 12y³ + y⁴

Example 3: Expand (2x − 1)⁵

a = 2x, b = −1, n = 5; coefficients 1, 5, 10, 10, 5, 1

= (2x)⁵ + 5(2x)⁴(−1) + 10(2x)³(−1)² + 10(2x)²(−1)³ + 5(2x)(−1)⁴ + (−1)⁵

Answer: 32x⁵ − 80x⁴ + 80x³ − 40x² + 10x − 1

Example 4: Expand (1 + x/2)⁶

a = 1, b = x/2, n = 6; coefficients 1, 6, 15, 20, 15, 6, 1

= 1 + 6(x/2) + 15(x/2)² + 20(x/2)³ + 15(x/2)⁴ + 6(x/2)⁵ + (x/2)⁶

Answer: 1 + 3x + (15/4)x² + (5/2)x³ + (15/16)x⁴ + (3/16)x⁵ + (1/64)x⁶

Example 5: Expand (4 − 3x)⁴

a = 4, b = −3x, n = 4; coefficients 1, 4, 6, 4, 1

= 4⁴ + 4 × 4³(−3x) + 6 × 4²(−3x)² + 4 × 4(−3x)³ + (−3x)⁴

Answer: 256 − 768x + 864x² − 432x³ + 81x⁴

3.1.2 Binomial coefficients and their calculation

Binomial coefficients are the numbers that multiply each term of a binomial expansion. The coefficient of the term containing bᵏ in (a + b)ⁿ is written C(n, k), also shown as ⁿCₖ or "n choose k", and is calculated with factorials. They can be found directly without writing out the whole expansion, which is useful when only one term is needed. Example: an analyst studying the reliability of six identical pumps at a municipal water treatment works uses C(6, 2) = 15 to count the ways two pumps can be out of service.

Formula for binomial coefficients

C(n, k) = n! ÷ [k!(n − k)!]

where n! = n × (n − 1) × (n − 2) × ... × 2 × 1, and 0! = 1.

Properties of binomial coefficients

• End values: C(n, 0) = C(n, n) = 1, so every expansion starts and ends with coefficient 1.
• Second values: C(n, 1) = C(n, n − 1) = n.
• Symmetry: C(n, k) = C(n, n − k), so the coefficients read the same from both ends.
• Largest coefficient: The middle coefficient (or the two middle ones when n is odd) is the largest.
• Sum of coefficients: C(n, 0) + C(n, 1) + ... + C(n, n) = 2ⁿ.

Steps in calculating a binomial coefficient

1. Identify n and k: n is the power; k is the power of b in the required term.
2. Write the factorial formula: C(n, k) = n! ÷ [k!(n − k)!].
3. Cancel the larger factorial: Cancel (n − k)! or k! against part of n!.
4. Multiply the remaining top numbers: Multiply the k factors from n downwards.
5. Divide by k!: Divide by the factorial of k.
6. Check using symmetry: Confirm C(n, k) = C(n, n − k) if needed.

Worked Examples

Example 1: Calculate C(5, 2)

C(5, 2) = 5! ÷ (2! × 3!)

= (5 × 4 × 3!) ÷ (2 × 1 × 3!) = 20 ÷ 2

Answer: 10

Example 2: Calculate C(7, 3)

C(7, 3) = 7! ÷ (3! × 4!)

= (7 × 6 × 5) ÷ (3 × 2 × 1) = 210 ÷ 6

Answer: 35

Example 3: Coefficient of a specific term

Given: Find the coefficient of x³ in (2 + x)⁶.

Tₖ₊₁ = C(6, k) × 2⁶⁻ᵏ × xᵏ, with k = 3

C(6, 3) = (6 × 5 × 4) ÷ (3 × 2 × 1) = 20

Coefficient = 20 × 2³ = 20 × 8

Answer: 160

Example 4: Middle term

Given: Find the middle term of (x − 2)⁴.

n = 4, so there are 5 terms and the middle is the 3rd (k = 2)

T₃ = C(4, 2) × x² × (−2)² = 6 × x² × 4

Answer: 24x²

3.1.3 Pascal's Triangle

Pascal's triangle is a triangular arrangement of numbers in which each row starts and ends with 1 and every other number is the sum of the two numbers directly above it. Each row gives the coefficients of a binomial expansion, so it offers a quick way to write expansions for small powers without factorials. Row numbering starts at 0 at the top. Example: a technician at a building contractor's office quickly expands (a + b)⁵ for a quantity formula by reading the coefficients 1, 5, 10, 10, 5, 1 from row 5.

Rows 0 to 7 of Pascal's triangle

Properties of Pascal's triangle

• Ones on the edges: Every row begins and ends with 1.
• Addition rule: Each inner number is the sum of the two numbers above it.
• Symmetry: Each row reads the same forwards and backwards.
• Row length: Row n has n + 1 entries.
• Row sums: The entries of row n add up to 2ⁿ, for example 1 + 4 + 6 + 4 + 1 = 16 = 2⁴.

Steps in building Pascal's triangle

1. Write row 0: Write a single 1 at the top.
2. Write row 1: Write 1 1 below it.
3. Start each new row with 1: Place 1 at the left end.
4. Add pairs from the row above: Each new inner number is the sum of the two numbers above it.
5. End the row with 1: Place 1 at the right end.
6. Repeat to the required row: Continue until row n is reached.

Worked Example

Given: Use Pascal's triangle to expand (a − b)⁵.

Row 5: 1 5 10 10 5 1

Signs alternate because b is negative

Answer: a⁵ − 5a⁴b + 10a³b² − 10a²b³ + 5ab⁴ − b⁵

3.1.4 Relationship between Pascal's triangle and binomial coefficients

Each entry in Pascal's triangle is a binomial coefficient: the kth entry in row n (counting from 0) equals C(n, k). The addition rule that builds the triangle is the identity C(n, k) + C(n, k + 1) = C(n + 1, k + 1), known as Pascal's rule. This link means coefficients can be read from the triangle for small powers and calculated by formula for large powers, and each method checks the other. Example: a student preparing load-combination tables for a structural design office checks that the formula value C(6, 2) = 15 matches the third entry of row 6 of the triangle.

Ways the triangle and the coefficients are linked

• Row entries: Row n reads C(n, 0), C(n, 1), C(n, 2), ..., C(n, n).
• Pascal's rule: C(n, k) + C(n, k + 1) = C(n + 1, k + 1), which is the addition rule of the triangle.
• Symmetry: C(n, k) = C(n, n − k) matches the mirror symmetry of each row.
• Row sum: Sum of row n = 2ⁿ, which is (1 + 1)ⁿ expanded.
• Choosing a method: Use the triangle for small n and the factorial formula for large n or a single term.

Worked Examples

Example 1: Matching row 4

Row 4: 1 4 6 4 1

C(4, 0) = 1, C(4, 1) = 4, C(4, 2) = 4! ÷ (2! × 2!) = 6, C(4, 3) = 4, C(4, 4) = 1

Answer: Row 4 is exactly C(4, 0) to C(4, 4).

Example 2: Checking Pascal's rule

Given: Verify C(5, 2) + C(5, 3) = C(6, 3).

C(5, 2) = 10 and C(5, 3) = 10

10 + 10 = 20

C(6, 3) = (6 × 5 × 4) ÷ (3 × 2 × 1) = 20

Answer: Both sides equal 20, matching the entry 20 in row 6.

Example 3: Sum of a row

Given: Find the sum of the coefficients in (a + b)⁷.

Sum = 2ⁿ = 2⁷

Row 7: 1 + 7 + 21 + 35 + 35 + 21 + 7 + 1 = 128

Answer: 128

Chapter Summary

This chapter focused on the binomial theorem and its application in expanding expressions of the form \((a + b)^n\), demonstrating how binomial coefficients can be calculated and understood through Pascal's Triangle. The relationship between Pascal’s Triangle and binomial coefficients was explored, showing the systematic way coefficients are generated for any power \(n\). The chapter then extended to binomial series coefficients, covering expansions involving fractional and negative powers, which broaden the scope of binomial expansion beyond whole numbers. It also addressed the use of binomial expansion for approximating values and estimating small changes, highlighting its importance in practical calculations. Real-life applications were discussed, particularly in financial calculations such as compound interest, where binomial expansion simplifies complex computations. Finally, the chapter emphasized how binomial expansion aids in minimizing errors in physics and engineering problems, making it a valuable tool for precise estimations in technical fields.