Electronics engineering technicians frequently encounter expressions that involve powers and expansions, especially when analyzing signal processing, circuit design, and digital systems. The binomial theorem provides a powerful tool for expanding expressions raised to a power without multiplying the entire product repeatedly. Mastery of binomial expansions enables efficient simplification of polynomial expressions common in filter design, error analysis, and modulation schemes in Kenyan electronics industries.

5.1 Basic concepts of binomial theorem

The binomial theorem gives a systematic way to expand expressions of the form (a + b)ⁿ, where n is a positive whole number. This topic introduces the notation and the two ingredients of the expansion, factorials and binomial coefficients. Expansions of this kind are used in electronics to approximate quantities such as (1 + x)ⁿ when x is small, and to work out the effect of small component tolerances.

5.1.1 Binomial expressions and notation

The binomial expression is any algebraic expression consisting of two terms connected by addition or subtraction, typically written as (a + b) or (a − b). When raised to a positive integer power n, the expression expands into a sum of terms involving powers of a and b multiplied by coefficients.

The binomial theorem states that:

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

written in short as the sum of the terms C(n, k) aⁿ⁻ᵏ bᵏ for k = 0, 1, 2, …, n.

where C(n, k) is the binomial coefficient.

Worked Examples

Example 1: Expand (x + 2)².

Given: a = x, b = 2, n = 2

(x + 2)² = the sum of C(2, k) x²⁻ᵏ 2ᵏ for k = 0 to 2

Calculate each term:

C(2, 0) x² 2⁰ = 1 × x² × 1 = x²

C(2, 1) x¹ 2¹ = 2 × x × 2 = 4x

C(2, 2) x⁰ 2² = 1 × 1 × 4 = 4

Answer: x² + 4x + 4

Example 2: Expand (3 + y)³.

Given: a = 3, b = y, n = 3

(3 + y)³ = the sum of C(3, k) 3³⁻ᵏ yᵏ for k = 0 to 3

Calculate each term:

C(3, 0) 3³ y⁰ = 1 × 27 × 1 = 27

C(3, 1) 3² y¹ = 3 × 9 × y = 27y

C(3, 2) 3¹ y² = 3 × 3 × y² = 9 y²

C(3, 3) 3⁰ y³ = 1 × 1 × y³ = y³

Answer: 27 + 27y + 9y² + y³

Example 3: Expand (1 + x)⁴.

Given: a = 1, b = x, n = 4

(1 + x)⁴ = the sum of C(4, k) 1⁴⁻ᵏ xᵏ for k = 0 to 4

Calculate each term:

C(4, 0) 1⁴ x⁰ = 1 × 1 × 1 = 1

C(4, 1) 1³ x¹ = 4 × 1 × x = 4x

C(4, 2) 1² x² = 6 × 1 × x² = 6x²

C(4, 3) 1¹ x³ = 4 × 1 × x³ = 4x³

C(4, 4) 1⁰ x⁴ = 1 × 1 × x⁴ = x⁴

Answer: 1 + 4x + 6x² + 4x³ + x⁴

5.1.2 Factorials and their use in binomial coefficients

Factorials are crucial in calculating binomial coefficients, which determine the number of ways to select k items from n items without regard to order. The factorial of a non-negative integer n, denoted n!, is the product of all positive integers less than or equal to n. The binomial coefficient formula uses factorials as follows:

C(n, k) = (n!) ÷ (k!(n-k)!)

Worked Examples

Example 1: Calculate 5!.

Given: n = 5

5! = 5 × 4 × 3 × 2 × 1

5! = 120

Answer: 120

Example 2: Calculate C(6, 2).

Given: n=6, k=2

C(6, 2) = (6!) ÷ (2! (6-2)!) = (6!) ÷ (2! 4!)

Calculate factorials:

6! = 720, 2! = 2, 4! = 24

Substitute:

C(6, 2) = 720 ÷ (2 × 24) = 720/48

C(6, 2) = 15

Answer: 15

Example 3: Calculate C(8, 3).

Given: n=8, k=3

C(8, 3) = (8!) ÷ (3! (8-3)!) = (8!) ÷ (3! 5!)

Calculate factorials:

8! = 40320, 3! = 6, 5! = 120

Substitute:

C(8, 3) = 40320 ÷ (6 × 120) = 40320/720

C(8, 3) = 56

Answer: 56

Example 4: Calculate C(10, 0).

Given: n=10, k=0

C(10, 0) = (10!) ÷ (0! 10!) = (10!) ÷ (1 × 10!) = 1

Answer: 1

Example 5: Calculate C(7, 7).

Given: n=7, k=7

C(7, 7) = (7!) ÷ (7! 0!) = (7!) ÷ (7! × 1) = 1

Answer: 1

5.1.3 Binomial Coefficients

Binomial coefficients C(n, k) represent the coefficients in the expanded form of (a + b)ⁿ. They have symmetrical properties and can be arranged in Pascal's triangle to quickly find values without factorial calculations. These coefficients are essential when determining the weight of each term in the binomial expansion.

Worked Examples

Example 1: Find the binomial coefficients for n=4.

Given: n=4

The coefficients are C(4, 0), C(4, 1), C(4, 2), C(4, 3), C(4, 4).

Calculate each:

C(4, 0) = 1

C(4, 1) = 4

C(4, 2) = 6

C(4, 3) = 4

C(4, 4) = 1

Answer: 1, 4, 6, 4, 1

Example 2: Use Pascal's triangle to find C(5, 3).

Using the row for n=5: 1, 5, 10, 10, 5, 1

C(5, 3) = 10

Answer: 10

Example 3: Expand (2 + x)³ using binomial coefficients.

Given: a=2, b=x, n=3

Coefficients for n=3 are 1, 3, 3, 1.

Expansion:

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

Calculate each term:

1 × 8 × 1 = 8

3 × 4 × x = 12x

3 × 2 × x² = 6x²

1 × 1 × x³ = x³

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

Example 4: Find the 4th term in the expansion of (1 + 3x)⁵.

The general term Tₖ₊₁ in (a + b)ⁿ is:

Tₖ₊₁ = C(n, k) aⁿ⁻ᵏ bᵏ

Given: n=5, a=1, b=3x, k=3 (since 4th term corresponds to k=3)

Calculate:

T₄ = C(5, 3) 1⁵⁻³ (3x)³ = C(5, 3) 1² 27 x³

From previous example, C(5, 3) = 10.

Therefore:

T₄ = 10 × 1 × 27 x³ = 270 x³

Answer: 270 x³

Example 5: Prove the symmetry property C(n, k) = C(n, n-k) for n=7, k=2.

Calculate C(7, 2):

C(7, 2) = (7!) ÷ (2! 5!) = 5040 ÷ (2 × 120) = 5040/240 = 21

Calculate C(7, 5):

C(7, 5) = (7!) ÷ (5! 2!) = 5040 ÷ (120 × 2) = 5040/240 = 21

Answer: Both equal 21, confirming symmetry

5.1.3.1 Definition and calculation using combinations (nCr)

A combination is a selection of r items from n different items when the order of the selection does not matter. The number of combinations is written C(n, r) (also ⁿCᵣ or nCr) and is calculated with factorials:

C(n, r) = n! ÷ (r! × (n − r)!)

These numbers are the binomial coefficients, because C(n, k) is the coefficient of aⁿ⁻ᵏ bᵏ in the expansion of (a + b)ⁿ. Basic results: C(n, 0) = C(n, n) = 1, C(n, 1) = C(n, n − 1) = n, and C(n, r) = C(n, n − r). Scientific calculators have an nCr key.

Example 1: A technician must pick 2 transistors to test from a tray of 6. How many different pairs are possible?

C(6, 2) = 6! ÷ (2! × 4!) = (6 × 5) ÷ (2 × 1) = 15

Answer: 15 different pairs

Example 2: Find the coefficient of x³ in the expansion of (1 + x)⁷.

The coefficient of x³ is C(7, 3) = 7! ÷ (3! × 4!) = (7 × 6 × 5) ÷ (3 × 2 × 1) = 35

Answer: 35

5.1.3.2 Pascal's Triangle as a tool for finding binomial coefficients

Pascal's triangle is a triangle of numbers in which each row gives the binomial coefficients for one power n. Each row starts and ends with 1, and every other number is the sum of the two numbers above it, to the left and to the right.

n = 0                 1
n = 1               1   1
n = 2             1   2   1
n = 3           1   3   3   1
n = 4         1   4   6   4   1
n = 5       1   5  10  10   5   1
n = 6     1   6  15  20  15   6   1

Row n lists C(n, 0), C(n, 1), …, C(n, n). For example, the entry 20 in row 6 is C(6, 3) = 20, and it is the sum 10 + 10 from row 5. The triangle is quick for small n; for larger n the factorial formula is used.

Example: Use Pascal's triangle to expand (2x + 1)⁴.

Row 4 gives the coefficients 1, 4, 6, 4, 1.

(2x + 1)⁴ = 1(2x)⁴ + 4(2x)³(1) + 6(2x)²(1)² + 4(2x)(1)³ + 1(1)⁴

= 16x⁴ + 4 × 8x³ + 6 × 4x² + 4 × 2x + 1

= 16x⁴ + 32x³ + 24x² + 8x + 1

Check with x = 1: (2 + 1)⁴ = 81 and 16 + 32 + 24 + 8 + 1 = 81.

Answer: 16x⁴ + 32x³ + 24x² + 8x + 1

Chapter Summary

This chapter introduced the basic concepts of the binomial theorem, including binomial expressions and the notation used to represent them. It explained the role of factorials in calculating binomial coefficients and demonstrated how these coefficients are determined using combinations, with Pascal's Triangle serving as a useful tool for finding them. The general form of the binomial expansion was presented, followed by expansions for powers \(n = 2, 3, 4\), and special cases such as expansions of \((1 + x)^n\) and those involving negative and fractional powers through the binomial series. The chapter also covered practical applications of binomial expansion in simplifying algebraic expressions and solving polynomial equations. Additionally, it highlighted the relevance of binomial expansions in various engineering contexts and their usefulness in estimating values during engineering calculations. This comprehensive approach equips students with both the theoretical understanding and practical skills needed to apply binomial expansions effectively in engineering problems.