MTH102 — Midterm Summary (Lectures 1–22)

📘 Lecture 1-3 — Sets and Numbering Systems

📖 Overview: This lecture introduces the foundational concepts of set theory, including definitions, notations, and algebraic properties of set operations. It then extends this foundation to describe the hierarchy of numbering systems—from natural numbers to complex numbers—and explains the historical need for extending number systems to solve equations. Understanding sets and number systems is essential for all higher mathematics.

🗂️ Topics Covered

The lecture begins with the definition and notation of sets, including roster and set-builder methods, and introduces the empty set and universal set. It then covers subset relationships, set equality, and the operations of union and intersection along with their algebraic properties. The second half of the lecture presents the classification of numbers: natural numbers, integers, rational numbers, irrational numbers, and real numbers, followed by the definition, graphical representation, arithmetic operations, conjugates, and modulus of complex numbers.

📝 Lecture Summary

Sets and Numbering Systems

The study of mathematics begins with a study of sets. Every mathematical system can be represented as a set. A set is an unordered collection of distinct objects. Objects in the collection are called elements of the set. For example, the collection of all towns in the Punjab province is a set, and each town is an element.

🔑 Definition — Set: An unordered collection of distinct objects. Objects in the collection are called elements of the set.

Notation: Sets are designated with capital letters; elements are designated with lower case letters. For instance, D could be the set of all four-legged dogs, and d an individual dog.

The roster method specifies a set by surrounding the collection of elements with braces. Example: the set of counting numbers from 1 to 5 is written as {1, 2, 3, 4, 5}.

Set builder notation has the general form {variable | descriptive statement}. The vertical bar is read as "such that". For example, {x | x < 6 and x is a counting number} is the set of all counting numbers less than 6, which is {1, 2, 3, 4, 5}. Set builder notation is used when the roster method is inappropriate or inadequate.

Other Notation: If x is an element of set A, we write x ∈ A. x ∉ A means x is not an element of A. Example: If A = {3, 17, 2}, then 3 ∈ A, 17 ∈ A, 2 ∈ A, and 5 ∉ A.

🔑 Definition — Empty Set: The set with no elements is called the empty set or the null set and is designated with the symbol ∅.

🔑 Definition — Universal Set: The set of all things pertinent to a given discussion, designated by the symbol U. For example, U = {all students at the Virtual University}.

🔑 Definition — Subset: set A is a subset of set B, denoted A ⊆ B, if every element of A is an element of B. If A is a subset of B and B contains elements not in A, then A is a proper subset of B, denoted A ⊂ B. If A is not a subset of B, we write A ⊄ B.

🔑 Definition — Set Equality: Two sets A and B are equal if A ⊆ B and B ⊆ A. We write A = B. In other words, two sets are equal if they contain the same elements.

🔑 Definition — Intersection: The intersection of two sets A and B is the set containing elements which are elements of A and elements of B. We write A ∩ B to denote A Intersection B. Example: If A = {3, 4, 6, 8} and B = {1, 2, 3, 5, 6}, then A ∩ B = {3, 6}.

🔑 Definition — Union: The union of two sets A and B is the set containing elements which are elements of A or elements of B. We write A ∪ B to denote A Union B. Example: If A = {3, 4, 6} and B = {1, 2, 3, 5, 6}, then A ∪ B = {1, 2, 3, 4, 5, 6}.

Algebraic Properties of Sets:

• Union and intersection are commutative: A ∪ B = B ∪ A and A ∩ B = B ∩ A.
• Union and intersection are associative: (A ∪ B) ∪ C = A ∪ (B ∪ C) and (A ∩ B) ∩ C = B ∩ (A ∩ C).
• Union and intersection are distributive with respect to each other: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) and A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C).
• A few other elementary properties: A ∪ ∅ = A, A ∩ ∅ = ∅, A ∪ A = A, A ∩ A = A.

Numbering Systems:

• Natural numbers (counting numbers) are denoted by N = {1, 2, 3, ...}.
• Integers are natural numbers, their opposites, and zero. The set of integers is denoted by Z = {..., -3, -2, -1, 0, 1, 2, 3, ...}.
• Rational numbers are numbers that can be written as a ratio of two integers. The set of rational numbers is denoted by Q. This includes repeating decimals, terminating decimals, and fractions. Integers are also rational since every integer a can be written as a/1.
• Irrational numbers are numbers that cannot be written as fractions. Examples include numbers with non-repeating, non-terminating decimal patterns (e.g., 3.45455455545555...), the square root of 2, π (Pi), and e.
• The union of the set of rational numbers and the set of irrational numbers is the set of Real numbers, denoted by R.
• N ⊂ Z ⊂ Q ⊂ R.

🔑 Definition — Cardinality: Cardinality refers to the number of elements in a set. A finite set has a countable number of elements. An infinite set has at least as many elements as the set of natural numbers. Notation: |A| represents the cardinality of set A.

History: Initially, numbers were used for counting, and natural numbers did that job well. However, there were no solutions for equations like x + 4 = 0. To resolve this, negative integers were invented. This allowed solutions for x + 4 = 0, but equations like x² + 4 = 0 still had no solutions (no real number whose square is -4). The system was extended again by inventing the "imaginary unit," denoted i = √(-1). Real numbers were extended by attaching this imaginary unit to each number.

🔑 Definition — Complex Numbers: Numbers of the form a + bi are called complex numbers. The set of complex numbers is denoted by C. Here, a is the real part and b is the imaginary part. Examples: 2 - 4i, -3 + 5i, and -5 + (3/4)i.

Graphical Representation: Real numbers are represented on a line. A complex number has a representation in a plane. The x-axis represents real numbers and the y-axis represents imaginary numbers. The complex number a + bi is represented as point P with coordinates (a, b).

Properties of Complex Numbers — Addition and Subtraction: For complex numbers a + bi and c + di:

• (a + bi) + (c + di) = (a + c) + (b + d)i
• (a + bi) - (c + di) = (a - c) + (b - d)i

📌 Example: (4 - 6i) + (-3 + 7i) = [4 + (-3)] + [-6 + 7]i = 1 + i (10 - 4i) - (5 - 2i) = (10 - 5) + [-4 - (-2)]i = 5 - 2i

Multiplication of Complex Numbers: For complex numbers a + bi and c + di, (a + bi)(c + di) = (ac - bd) + (ad + bc)i. The product is found by multiplying as if the numbers were binomials and using i² = -1.

📌 Example: (2 - 4i)(3 + 5i) = 2(3) + 2(5i) - 4i(3) - 4i(5i) = 6 + 10i - 12i - 20i² = 6 - 2i - 20(-1) = 26 - 2i

🔑 Definition — Conjugate: Given a complex number z = a + ib, its conjugate is defined as z* = a - ib.

Properties of Conjugates:

• (z*)* = z
• z · z* = a² + b² (real)
• z + z* = 2a (real)
• z - z* = 2ib (imaginary)

Division of Complex Numbers: For complex numbers a + bi and c + di, the quotient is found by multiplying and dividing by the conjugate of the denominator: (a + bi) / (c + di) = (a + bi)(c - di) / (c + di)(c - di) = (ac + bd)/(c² + d²) + i(bc - ad)/(c² + d²)

📌 Example: (3 + 11i) / (-1 + 2i) = (3 + 11i)(-1 - 2i) / (-1 + 2i)(-1 - 2i) = (-3 - 6i - 11i - 22i²) / (1 - 2i + 2i - 4i²) = (-3 - 17i + 22) / (1 + 4) = (19 - 17i) / 5 = 19/5 - (17/5)i

🔑 Definition — Modulus: The absolute value or modulus of a complex number is the distance the complex number is from the origin on the complex plane. If z = a + bi, then |z| = √(a² + b²).

📌 Example: |-2 + 5i| = √((-2)² + 5²) = √(4 + 25) = √29

💡 Why this matters: Understanding the hierarchy of number systems explains why certain equations have solutions in one system but not another. Complex numbers are essential in fields like electrical engineering, quantum physics, and signal processing, where quantities have both magnitude and phase.

⭐ Key Takeaways

A set is an unordered collection of distinct objects, defined by roster or set-builder notation. Key operations include union, intersection, and subset relationships, which follow commutative, associative, and distributive laws. The numbering systems progress from natural numbers (N) to integers (Z), rational numbers (Q), real numbers (R), and finally to complex numbers (C), where N ⊂ Z ⊂ Q ⊂ R ⊂ C. Complex numbers of the form a + bi are represented on a plane, and their arithmetic (addition, subtraction, multiplication, division) relies on the property i² = -1. The conjugate and modulus are fundamental tools for division and measuring distance from the origin.

🧠 Quick Revision Questions

1. What is the difference between a proper subset and a subset? When is a set not a proper subset of another?
2. Using set builder notation, how would you write the set of all integers greater than -3 and less than or equal to 5?
3. What are the commutative and distributive properties of set union and intersection? Provide one example for each.
4. How do you multiply two complex numbers? Show the steps to find the product of (1 + 2i) and (3 - 4i).
5. Calculate the quotient (1 + i) / (2 - i). What step requires the use of the conjugate?

📘 Lecture 4-7 — Functions and Quadratics

📖 Overview: This lecture covers a wide range of topics from the basic definition of relations and functions to the algebra of functions, composite and inverse functions, and quadratic functions. It provides the fundamental tools for understanding how mathematical relationships are defined, combined, and inverted, which is critical for solving equations and modeling real-world phenomena.

🗂️ Topics Covered

The lecture begins by defining mappings and the four types of relations (one-one, many-many, many-one, one-many), identifying many-one and one-one relations as functions. It then defines domain and range, followed by even and odd functions. The concepts of sum, difference, product, quotient, and composite functions (fog) are explained with examples. The lecture continues with inverse functions, their properties, and the step-by-step method to find them. Finally, it introduces quadratic functions and four methods for solving quadratic equations: graphing, factorization, completing the square, and the quadratic formula, including the role of the discriminant.

📝 Lecture Summary

2. Relations and Functions

A mapping (or relation) is a rule for relating elements of one set to another. There are four types of relations:

• One-One Relations: Each member of the pre-image is mapped to exactly one member of the image. (e.g., numbers 1-5 mapping to 6-10).
• Many-Many Relations: Many members of the image are images of more than one member of the pre-image, and vice-versa. (e.g., people mapping to countries they have visited).
• Many-One Relations: Two or more members of the pre-image are mapped to exactly one member of the image. (e.g., people mapping to their mass in kg).
• One-Many Relations: One member of the pre-image is mapped to two or more members of the image. (e.g., a pen mapping to two different lengths in cm).

Functions are defined as Many-One and One-One relationships. The set of all inputs (pre-image) is called the domain, and the set of all outputs (images) is called the range. To define a function, both the formula and the domain are required.

🔑 Definition — Function: A relation where each element of the domain is mapped to exactly one element of the range.

Examples:

1. f(x) = 2x + 1 ; Domain: x = ℝ, Range: f(x) = ℝ
2. g(x) = 1/(x-2) ; Domain: x = ℝ – {2}, Range: g(x) = ℝ
3. h(x) = √(x-3) ; Domain: {x ε ℝ | x ≥ 3}, Range: h(x) ≥ 0
4. q(x) = (x+1)² + 2 ; Domain: x = ℝ, Range: q(x) ≥ 2

3. Even and Odd Functions

A function can be classified based on the symmetry of its graph. An even function has a graph that is symmetric with respect to the vertical (y) axis. An odd function has a graph that is symmetric with respect to the origin.

🔑 Definition — Even Function: f(-x) = f(x) for all x in the domain. Example: f(x) = x² 🔑 Definition — Odd Function: f(-x) = -f(x) for all x in the domain. Example: f(x) = x³

4. Algebra of Functions

Functions can be combined using arithmetic operations.

• (f + g)(x) = f(x) + g(x)
• (f – g)(x) = f(x) – g(x)
• (fg)(x) = f(x)g(x)
• (f/g)(x) = f(x)/g(x), provided g(x) ≠ 0

5. Composite Functions

A composite function is created when one function is performed on the result of another. The function fog means "g is performed first, then f is performed on the result of g."

• (f ∘ g)(x) = f(g(x))

Example: Given f(x) = 3x + 2 and g(x) = x²: (f ∘ g)(x) = f(g(x)) = f(x²) = 3x² + 2 The domain of fog is the set of all x in the domain of g where g(x) is in the domain of f.

📌 Example: Given f(x) = √(4 - x²) (Domain: -2 ≤ x ≤ 2) and g(x) = √(3-x) (Domain: x ≤ 3), find (f ∘ g)(x). (f ∘ g)(x) = f(g(x)) = f(√(3-x)) = √(4 - (3-x) / (1+x)) 💡 Why this matters: Even though the simplified form is defined for x ≥ -1, the domain must also be restricted by the domain of g, so the final Domain is -1 ≤ x ≤ 3.

6. Inverse Functions

If f is a one-one function, then its inverse function, denoted f⁻¹, is formed by reversing the order of the mapping. If f(a) = b, then f⁻¹(b) = a. A function must be one-to-one for its inverse to also be a function.

Steps for finding an inverse:

1. Find the domain of f and verify it is one-to-one. If not, stop.
2. Solve y = f(x) for x.
3. Interchange x and y in the result.
4. Find the domain of the inverse function.

Properties:

• Domain of f⁻¹ = Range of f
• Range of f⁻¹ = Domain of f

📌 Example: Find the inverse of f(x) = (x-2)² + 3 with domain x ≥ 2.

1. Domain of f is x ≥ 2; Range is y ≥ 3. It is one-to-one.
2. y - 3 = (x-2)² → √(y-3) = x-2 → x = 2 + √(y-3)
3. Final Answer: f⁻¹(x) = 2 + √(x-3), with domain x ≥ 3.
4. Verification: f[f⁻¹(x)] = x and f⁻¹[f(x)] = x.
5. The graph of the inverse can be found by reflecting the original function across the line y = x.

7. Quadratic Functions

A quadratic function is of the form y = ax² + bx + c where a, b, and c are constants (coefficients).

• The graph is a parabola.
• If a > 0, the parabola opens upwards (concave upward).
• If a < 0, the parabola opens downwards (concave downward).
• The value of c shifts the graph vertically.

Setting y = 0 gives a quadratic equation: ax² + bx + c = 0. The solutions are the x-intercepts of the parabola.

8. Solving Quadratic Equations

There are four primary methods:

1. Graphing Method: Use a calculator to plot the function and read the x-intercepts.

2. Factorization Method: Write the equation in standard form and factor it. 📌 Example: x² = 5x - 6 → x² - 5x + 6 = 0 → (x-3)(x-2) = 0 → x = 3, x = 2

3. Completing the Square Method: Rearrange the equation so the coefficient of x² is 1, then add (b/2)² to both sides to form a perfect square. 📌 Example: x² + 6x + 3 = 0 x² + 6x = -3 x² + 6x + 9 = -3 + 9 (x+3)² = 6 x+3 = ±√6 x = -3 ± √6, so x ≈ -0.55 and x ≈ -5.45.

4. Formula Method: Use the quadratic formula derived from completing the square. 📐 Formula: For ax² + bx + c = 0: x = (-b ± √(b² - 4ac)) / 2a

   The expression inside the square root, b² - 4ac, is called the discriminant.

   • If b² - 4ac > 0: Two distinct real solutions.
   • If b² - 4ac = 0: Exactly one real solution.
   • If b² - 4ac < 0: No real solutions.

📌 Example: For x² + 6x + 3 = 0 (a = 1, b=6, c=3): x = (-6 ± √(36 - 12)) / 2 x = (-6 ± √24) / 2 x = -3 ± √6 (Same as completing the square).

📌 Example with Discriminant:

• 2x² + 7x + 4 = 0: b² - 4ac = 17 > 0 → Two distinct real solutions.
• 2x² + 4x + 2 = 0: b² - 4ac = 0 → Exactly one real solution.
• 3x² + 4x + 2 = 0: b² - 4ac = -8 < 0 → No real solutions.

⭐ Key Takeaways

A function is a special type of relation (one-one or many-one) where each input has exactly one output. The domain is the set of all inputs and the range is the set of all outputs. Functions can be combined through arithmetic or composition, where the domain of a composite function (f∘g)(x) must be restricted by the domains of both constituent functions. An inverse function f⁻¹ reverses a function's mapping, but only exists if the original function is one-to-one. A quadratic function y = ax² + bx + c graphs as a parabola, and its equation can be solved to find x-intercepts using factoring, completing the square, or the quadratic formula x = (-b ± √(b² - 4ac)) / 2a. The discriminant b² - 4ac determines the number and type of real solutions.

🧠 Quick Revision Questions

1. What are the four types of relations, and which two are considered functions?
2. If f(x) = 2x + 3 and g(x) = x², what is the expression for (f ∘ g)(x)?
3. What are the necessary steps to find the inverse of a function, and what condition must the function meet for its inverse to also be a function?
4. State the Quadratic Formula and explain what the discriminant tells you about the solutions of a quadratic equation.
5. Solve the quadratic equation x² - 2x - 8 = 0 using the factorization method.

📘 Lecture 8-12 — Matrices and Determinants

📖 Overview: This lecture introduces matrices, their operations, and determinants as fundamental tools in linear algebra. It covers matrix addition, subtraction, scalar multiplication, and matrix multiplication, alongside methods for solving systems of linear equations using row operations, inverse matrices, and Cramer’s Rule.

🗂️ Topics Covered

The lecture begins with the definition and notation of matrices, then covers matrix operations including addition, subtraction, scalar multiplication, and matrix multiplication. It introduces the identity matrix and inverse of a matrix, followed by methods for solving systems of equations using row operations on augmented matrices, finding inverses, and evaluating determinants. The lecture concludes with cofactors, adjoints, and Cramer’s Rule.

📝 Lecture Summary

Matrices and Determinants

A matrix is a rectangular arrangement of numbers in rows and columns. The order of a matrix is the number of rows and columns, and the entries are the numbers within the matrix. A matrix A with m rows and n columns has order m x n.

🔑 Definition — Matrix: A rectangular arrangement of numbers in rows and columns, denoted as A = (aᵢⱼ), where aᵣₛ represents the entry in the rth row and sth column.

🔑 Definition — Order of a Matrix: The number of rows and columns in a matrix, expressed as m x n.

Operations on Matrices

To add two matrices, they must have the same order. We add by summing corresponding entries. Subtraction requires the same order, where we subtract corresponding entries. In matrix algebra, a real number is called a scalar. To multiply a matrix by a scalar, multiply each entry in the matrix by that scalar.

📐 Formula: Scalar Multiplication: k[A] = [k × aᵢⱼ] → Multiply every element by the scalar k

📌 Example: Add matrices ⎡5 -3⎤ ⎡-2 1⎤ ⎡5+(-2) -3+1⎤ ⎡3 -2⎤ ⎢-3 4 ⎥ + ⎢ 3 0⎥ = ⎢-3+3 4+0⎥ = ⎢0 4⎥ ⎣0 7 ⎦ ⎣4 -3⎦ ⎣0+4 7+(-3)⎦ ⎣4 4⎦

📌 Example: Scalar multiplication 4⎡-2 0⎤ = ⎡4(-2) 4(0)⎤ = ⎡-8 0⎤ ⎣4 -1⎦ ⎣4(4) 4(-1)⎦ ⎣16 -4⎦

Matrix Multiplication

Given an r x c matrix A and an s x d matrix B, we can multiply A with B to form AB only if c = s. The resulting matrix AB has dimension r x d. The multiplication involves multiplying each row of the first matrix by each column of the second matrix.

📐 Formula: Matrix Multiplication: (AB)ᵢⱼ = Σₖ aᵢₖ × bₖⱼ → Multiply entries of row i of A with entries of column j of B and sum

📌 Example: Multiply A = ⎡2 3⎤ and B = ⎡1 1 1⎤ ⎢1 1⎥ ⎣1 0 2⎦ ⎣1 0⎦ C = AB = ⎡2(1)+3(1)=5 2(1)+3(0)=2 2(1)+3(2)=8⎤ = ⎛5 2 8⎞ ⎢1(1)+1(1)=2 1(1)+1(0)=1 1(1)+1(2)=3⎥ ⎜2 1 3⎟ ⎣1(1)+0(1)=1 1(1)+0(0)=1 1(1)+0(2)=1⎦ ⎝1 1 1⎠

🔑 Definition — Identity Matrix I: A square matrix with ones on the diagonal and zeros elsewhere.

🔑 Definition — Inverse of a Matrix: Given a square matrix B, if there exists a matrix D such that BD = DB = I, then D is the inverse of B, denoted D = B⁻¹.

System of Equations as Matrix Equation

A system of equations Σ aⱼxⱼ = bᵢ can be written as the matrix equation Ax = b, where A is the coefficient matrix, x is the column matrix of variables, and b is the column matrix of constants. If A⁻¹ exists, the unique solution is x = A⁻¹b.

Echelon Form and Row Operations

A matrix is in echelon form if: (1) Every non-zero row begins with a 1 (leading 1), (2) Every leading one in a lower row is further right than the one above, (3) Zero rows are at the end. A matrix is in reduced echelon form if additionally every other entry in a column containing a leading one is zero.

Three row operations preserve the system: Multiply a row by a non-zero constant, add a multiple of one row to another, and interchange two rows.

📌 Example: Solve using row operations: x + 2y + z = 1 2x + 2y = 2 3x + 5y + 4z = 1

The augmented matrix (Ab) is row reduced to ⎡1 0 0 0⎤, giving solution: x = 0, y = 1, z = -1 ⎢0 1 0 1⎥ ⎣0 0 1 -1⎦

Finding Inverse Using Row Operations

Given an n×n matrix A, if the augmented matrix (A|I) can be row reduced to (I|B), then B is the inverse of A. If (A|I) cannot be reduced to (I|B), then A has no inverse.

📌 Example: Find inverse of A = ⎡2 -2 2⎤ ⎢0 2 -1⎥ ⎣2 3 0⎦ After row reducing (A|I), we obtain A⁻¹ = ⎡3/2 3 -1⎤ ⎢-1 -2 1⎥ ⎣-2 -5 2⎦ The solution is x = A⁻¹b, yielding x = (11/2, -4, -9).

Determinants

The determinant is a function from the set of all square matrices to real numbers. For a 2×2 matrix, det ⎡a₁₁ a₁₂⎤ = a₁₁a₂₂ - a₂₁a₂₂. ⎣a₂₁ a₂₂⎦

📐 Formula: Second Order Determinant: │a₁₁ a₁₂│ = a₁₁a₂₂ - a₂₁a₂₂ │a₂₁ a₂₂│

📌 Example: │-1 2│ = (-1)(-4) - (-3)(2) = 4 + 6 = 10 │-3 -4│

Minors, Cofactors, and Adjoint

The minor of an element in a third-order determinant is a second-order determinant obtained by deleting the row and column containing that element. The cofactor of aᵢⱼ is Cᵢⱼ = (-1)ⁱ⁺ʲ × (Minor of aᵢⱼ). The value of a third-order determinant equals the sum of products obtained by multiplying each element of any row or column by its cofactors.

🔑 Definition — Adjoint (Adjugate): The transpose of the matrix of cofactors, denoted adj(A) = (Cᵢⱼ)ᵀ

📐 Formula: Inverse using Determinant: A⁻¹ = (1/|A|) × adj(A)

📌 Example: Find inverse of A = ⎡-2 1 3⎤ ⎢0 -1 1⎥ ⎣1 2 0⎦ Cofactors computed give adj(A) = ⎡-2 6 4⎤, |A| = 8, so A⁻¹ = (1/8)⎡-2 6 4⎤ ⎢1 -3 2⎥ ⎢1 -3 2⎥ ⎣1 5 2⎦ ⎣1 5 2⎦

Cramer’s Rule

Cramer’s Rule provides a method for solving systems of equations using determinants. For a system a₁₁x₁ + a₁₂x₂ = b₁, a₂₁x₁ + a₂₂x₂ = b₂, the solution is x₁ = Δ₁/Δ and x₂ = Δ₂/Δ, where Δ = det(A), Δ₁ = ⎡b₁ a₁₂⎤, Δ₂ = ⎡a₁₁ b₁⎤. ⎣b₂ a₂₂⎦ ⎣a₂₁ b₂⎦

📌 Example: Solve using Cramer’s Rule: x₁ + 2x₂ + x₃ = 1 2x₁ + 2x₂ = 2 3x₁ + 5x₂ + 4x₃ = 1 Δ = -4, Δ₁ = 0, Δ₂ = -4, Δ₃ = 4 Solution: x₁ = 0/(-4) = 0, x₂ = -4/(-4) = 1, x₃ = 4/(-4) = -1

⭐ Key Takeaways

The essential concepts from this lecture include understanding matrix operations (addition, subtraction, scalar multiplication, and multiplication) with their compatibility conditions, particularly that matrix multiplication requires the inner dimensions to match. Solving systems of linear equations can be achieved through row reduction of augmented matrices, using the inverse matrix formula x = A⁻¹b, or applying Cramer’s Rule with determinants. Determinants must be evaluated using minors and cofactors, and the inverse of a matrix can be found either through row reduction or the formula A⁻¹ = (1/|A|)adj(A). Remember that a system has a unique solution only when det(A) ≠ 0 and A⁻¹ exists.

🧠 Quick Revision Questions

1. What condition must be satisfied for two matrices to be added or subtracted?
2. How do you determine if matrix multiplication AB is possible, and what is the dimension of the resulting product?
3. What is the formula for finding the inverse of a matrix using determinants?
4. How does Cramer’s Rule express the solution variables of a 3×3 system?
5. What is the difference between a minor and a cofactor of an element in a determinant?

📘 Lecture 13-15 — Sequences and Series

📖 Overview: This lecture introduces the fundamental concepts of sequences and series, progressing from arithmetic to geometric progressions. It covers definitions, formulas for finding specific terms, and methods for summing series, including the convergence of infinite geometric series, which is critical for understanding mathematical modeling and analysis.

🗂️ Topics Covered

The lecture begins by defining sequences and their notation, then introduces arithmetic sequences (or progressions) with their inductive definition and formula for the nth term. It moves to arithmetic series and their sum formula, followed by geometric sequences with their common ratio and nth term formula. The lecture concludes with geometric series, their sum formula, and the important concept of convergent and divergent series, including the formula for the sum of an infinite geometric series.

📝 Lecture Summary

Definition: Rows of numbers are called sequences, and the separate numbers are called terms of the sequence.

A sequence is an ordered list of numbers, where each number is a term. The first term is denoted a₁, the second a₂, and the nth term aₙ. This notation is standard for referring to any specific term in the sequence.

Definition: An Arithmetic Sequence (or Arithmetic Progression) is a sequence in which each term after the first term is found by adding a constant, called the common difference (d), to the previous term.

An arithmetic sequence has a constant difference between consecutive terms. Its inductive definition is: a₁ = a and aₙ = aₙ₋₁ + d. The explicit formula for finding any term is aₙ = a + (n-1)d, where 'a' is the first term, 'd' is the common difference, and 'n' is the term number.

📐 Formula: aₙ = a + (n-1)d → The nth term is the first term plus (n-1) times the common difference.

📌 Example: Given the sequence, 1500, 3000, 4500, 6000, ..., find the 16th term. Solution: a = 1500, d = 1500, n-1 = 16-1 = 15. So a₁₆ = 1500 + 1500(15) = 24000. 💡 Why this matters: This formula allows you to find any term in an arithmetic progression without listing all preceding terms.

Definition: An Arithmetic Series is the sum of the terms in an arithmetic sequence.

An arithmetic series is the sum of the terms of an arithmetic sequence. For example, the arithmetic sequence 2, 4, 6, 8, 10 corresponds to the arithmetic series 2 + 4 + 6 + 8 + 10.

📐 Formula: To find the sum of the first n terms of an arithmetic sequence: Sₙ = n/2 (a + aₙ) = n/2 (2a + (n-1)d) → The sum is half the number of terms multiplied by the sum of the first and last term.

📌 Example: Find the sum of the first 50 terms of an arithmetic series with a = 28 and d = -4. Solution: n = 50, a = 28, d = -4. Using Sₙ = n/2 (2a + (n-1)d): S₅₀ = 50/2 (2(28) + (50-1)(-4)) = 25(56 + 49(-4)) = 25(56 – 196) = 25(-140) = -3500.

Definition: A sequence in which each term after the first is found by multiplying the previous term by a constant value called the common ratio, is called a Geometric Sequence (or Geometric Progression).

A geometric sequence has a constant ratio between consecutive terms. The formula for finding any term is aₙ = arⁿ⁻¹, where 'a' is the first term, 'r' is the common ratio, and 'n' is the term number.

📐 Formula: aₙ = arⁿ⁻¹ → The nth term is the first term multiplied by the common ratio raised to the power of (n-1).

📌 Example: Find the 10th term of the geometric sequence with a = 2000 and a common ratio of 1/2. Solution: a₁₀ = 2000 * (1/2)⁹ = 2000 * 1/512 = 2000/512 = 500/128 = 250/64 = 125/32.

Definition: A Geometric Series is the sum of the terms in a arithmetic sequence.

A geometric series is the sum of the terms of a geometric sequence.

📐 Formula: The sum of the first n terms of a geometric sequence is: Sₙ = a(1 - rⁿ) / (1 - r) → The sum is the first term times one minus the common ratio to the power of n, all divided by one minus the common ratio.

📌 Example: Find the sum ∑ₙ₌₁⁴ -3(2)ⁿ⁻¹. Solution: This is a geometric series with first term a = -3 and common ratio r = 2. S₄ = -3(1 - 2⁴) / (1 - 2) = -3(1 - 16) / (-1) = -3(-15) / (-1) = 45 / (-1) = -45.

Definition: If a sequence of numbers approaches (or converges) to a finite number, we say that the sequence is convergent. If a sequence does not converge to a finite number it is called divergent.

A sequence is convergent if its terms approach a finite number; otherwise, it is divergent. For a geometric series with sum Sₙ = a(1 - rⁿ) / (1 - r), the factor rⁿ determines convergence: if |r| > 1, |rⁿ| increases indefinitely, and the series diverges. If |r| < 1, |rⁿ| tends to zero as n tends to infinity, so the sum converges.

📐 Formula: For an infinite geometric series where |r| < 1, the sum is S∞ = a / (1 - r) → The infinite sum is the first term divided by one minus the common ratio.

📌 Example: Evaluate ∑ₙ₌₁^∞ 35(-1/4)ⁿ⁻¹. Solution: This is an infinite geometric series with a = 35 and r = -1/4. Since |r| = 1/4 < 1, it converges. S∞ = 35 / (1 - (-1/4)) = 35 / (5/4) = 35 * (4/5) = 28.

⭐ Key Takeaways

The most critical concepts for the exam are the definitions and formulas for arithmetic and geometric sequences and series. For arithmetic sequences, you must know the nth term formula aₙ = a + (n-1)d and the sum formula Sₙ = n/2(2a + (n-1)d). For geometric sequences, you must know the nth term formula aₙ = arⁿ⁻¹ and the sum formula Sₙ = a(1-rⁿ)/(1-r). Additionally, you need to understand the convergence condition for infinite geometric series: it converges to S∞ = a/(1-r) only when |r| < 1, and diverges otherwise.

🧠 Quick Revision Questions

1. What is the formula for the nth term of an arithmetic sequence, and what do each of the variables represent?
2. How do you determine if an infinite geometric series converges or diverges?
3. Write the formula for the sum of the first n terms of a geometric sequence.
4. Given an arithmetic series with a = 10 and d = 5, what is the sum of the first 20 terms?
5. Find the sum of the infinite geometric series: 27, 9, 3, 1, ...

📘 Lecture 18 — Review Matrices

📖 Overview: This lecture provides a comprehensive review of matrices, covering their definitions, types, basic operations, and key properties. Understanding matrices is fundamental for solving systems of linear equations and forms the basis for more advanced topics in linear algebra and its applications in various fields.

🗂️ Topics Covered

The lecture begins with the definition and notation of matrices, followed by a classification of different types of matrices including row, column, square, zero, identity, diagonal, scalar, triangular, and symmetric matrices. It then explains the basic operations of addition, subtraction, and scalar multiplication of matrices, before delving into the crucial operation of matrix multiplication and its properties. Finally, the transpose of a matrix and the concept of determinant for square matrices are introduced.

📝 Lecture Summary

Definition and Notation of Matrices

A matrix is a rectangular array of numbers (or elements) arranged in rows and columns. The element in the i-th row and j-th column is denoted as (a_{ij}). A matrix with (m) rows and (n) columns is called an (m \times n) matrix (read "m by n"). Matrices are typically denoted by capital letters like (A, B, C).

🔑 Definition — Matrix: A rectangular array of numbers enclosed in brackets. 📐 Notation: (A = [a_{ij}]{m \times n}) → A matrix A with elements a_ij, having m rows and n columns. 📌 Example: The matrix (A = \begin{bmatrix} 1 & 2 & 3 \ 4 & 5 & 6 \end{bmatrix}) is a (2 \times 3) matrix. Here (a{11}=1, a_{12}=2, a_{13}=3, a_{21}=4, a_{22}=5, a_{23}=6).

Types of Matrices

Several special types of matrices are defined based on their shape and elements. A row matrix has only one row ((1 \times n)). A column matrix has only one column ((m \times 1)). A square matrix has the same number of rows and columns ((n \times n)). A zero matrix (or null matrix) has all elements equal to zero. An identity matrix is a square matrix with 1s on the main diagonal and 0s elsewhere, denoted by (I). A diagonal matrix is a square matrix where all non-diagonal elements are zero. A scalar matrix is a diagonal matrix where all diagonal elements are equal. An upper triangular matrix has all elements below the main diagonal equal to zero, while a lower triangular matrix has all elements above the main diagonal equal to zero. A symmetric matrix is a square matrix that is equal to its transpose ((A = A^T)).

🔑 Definition — Square Matrix: A matrix where the number of rows equals the number of columns. 🔑 Definition — Identity Matrix: A square matrix with 1s on the main diagonal and 0s elsewhere. 📌 Example: (I_2 = \begin{bmatrix} 1 & 0 \ 0 & 1 \end{bmatrix}) is a (2 \times 2) identity matrix. 📌 Example: (A = \begin{bmatrix} 1 & 0 \ 0 & 5 \end{bmatrix}) is a diagonal matrix, but not a scalar matrix because the diagonal elements are different. 📌 Example: (B = \begin{bmatrix} 1 & 2 & 3 \ 0 & 4 & 5 \ 0 & 0 & 6 \end{bmatrix}) is an upper triangular matrix.

Matrix Operations: Addition and Scalar Multiplication

Two matrices can be added (or subtracted) only if they have the same dimensions (i.e., same number of rows and columns). The resulting matrix has the same dimensions, and each element is the sum (or difference) of the corresponding elements. Scalar multiplication involves multiplying every element of a matrix by a constant (scalar).

🔑 Definition — Matrix Addition: For matrices (A = [a_{ij}]) and (B = [b_{ij}]) of the same size, (A+B = [a_{ij} + b_{ij}]). 🔑 Definition — Scalar Multiplication: For matrix (A = [a_{ij}]) and scalar (k), (kA = [k \cdot a_{ij}]). 📌 Example: Given (A = \begin{bmatrix} 1 & 2 \ 3 & 4 \end{bmatrix}) and (B = \begin{bmatrix} 5 & 6 \ 7 & 8 \end{bmatrix}), then (A+B = \begin{bmatrix} 1+5 & 2+6 \ 3+7 & 4+8 \end{bmatrix} = \begin{bmatrix} 6 & 8 \ 10 & 12 \end{bmatrix}). 📌 Example: For (A = \begin{bmatrix} 1 & 2 \ 3 & 4 \end{bmatrix}) and scalar (k=3), (3A = \begin{bmatrix} 3\cdot1 & 3\cdot2 \ 3\cdot3 & 3\cdot4 \end{bmatrix} = \begin{bmatrix} 3 & 6 \ 9 & 12 \end{bmatrix}).

Matrix Multiplication

Matrix multiplication is not element-wise. For the product (AB) to be defined, the number of columns of matrix (A) must equal the number of rows of matrix (B). If (A) is an (m \times n) matrix and (B) is an (n \times p) matrix, then the product (AB) is an (m \times p) matrix. The element in the i-th row and j-th column of (AB) is found by taking the dot product of the i-th row of (A) with the j-th column of (B). 💡 Why this matters: Matrix multiplication is not commutative ((AB \neq BA) in general). It is associative ((A(BC) = (AB)C)) and distributive over addition ((A(B+C) = AB + AC)).

🔑 Definition — Matrix Multiplication: If (A = [a_{ij}]) is (m \times n) and (B = [b_{ij}]) is (n \times p), then (C = AB = [c_{ij}]) is (m \times p), where (c_{ij} = \sum_{k=1}^{n} a_{ik} b_{kj}). 📌 Example: Let (A = \begin{bmatrix} 1 & 2 \ 3 & 4 \end{bmatrix}) and (B = \begin{bmatrix} 5 & 6 \ 7 & 8 \end{bmatrix}). To find (c_{11}) of (AB): multiply elements of row 1 of A (1, 2) with column 1 of B (5, 7) and add: ((1\cdot5) + (2\cdot7) = 5+14 = 19). The complete product is (AB = \begin{bmatrix} (1\cdot5)+(2\cdot7) & (1\cdot6)+(2\cdot8) \ (3\cdot5)+(4\cdot7) & (3\cdot6)+(4\cdot8) \end{bmatrix} = \begin{bmatrix} 19 & 22 \ 43 & 50 \end{bmatrix}).

Transpose of a Matrix

The transpose of a matrix (A), denoted by (A^T), is obtained by interchanging the rows and columns of (A). If (A) is an (m \times n) matrix, then (A^T) is an (n \times m) matrix. The element (a_{ij}) of (A) becomes the element (a_{ji}) of (A^T).

🔑 Definition — Transpose of a Matrix: For a matrix (A = [a_{ij}]{m \times n}), (A^T = [a{ji}]_{n \times m}). 📌 Example: If (A = \begin{bmatrix} 1 & 2 \ 3 & 4 \ 5 & 6 \end{bmatrix}) (a (3 \times 2) matrix), then (A^T = \begin{bmatrix} 1 & 3 & 5 \ 2 & 4 & 6 \end{bmatrix}) (a (2 \times 3) matrix).

Determinant of a Matrix

The determinant is a scalar value that is computed from the elements of a square matrix. It is denoted by (\det(A)) or (|A|). For a (2 \times 2) matrix (A = \begin{bmatrix} a & b \ c & d \end{bmatrix}), the determinant is (\det(A) = ad - bc). For larger matrices, the determinant can be found using expansion by minors or other methods. The determinant has important geometric and algebraic properties, such as signaling whether a matrix is invertible ((\det(A) \neq 0) for an invertible matrix). 💡 Why this matters: The determinant is essential for solving systems of linear equations using Cramer's rule and for finding eigenvalues of a matrix.

🔑 Definition — Determinant: A scalar function that associates a unique number to every square matrix. 📐 Formula: For a (2 \times 2) matrix (A = \begin{bmatrix} a & b \ c & d \end{bmatrix}), (\det(A) = ad - bc). 📌 Example: Find the determinant of (A = \begin{bmatrix} 1 & 2 \ 3 & 4 \end{bmatrix}). Using the formula, (\det(A) = (1)(4) - (2)(3) = 4 - 6 = -2).

⭐ Key Takeaways

Matrices are fundamental rectangular arrays of numbers with specific operations. The key skills are identifying different types of matrices (square, identity, zero, diagonal), correctly performing matrix addition and scalar multiplication (dimensions must match for addition), and understanding the crucial row-by-column rule for matrix multiplication. The transpose operation swaps rows and columns, and the determinant is a special scalar value only for square matrices, computed as (ad-bc) for a (2\times 2) matrix. Remember that matrix multiplication is not commutative.

🧠 Quick Revision Questions

1. What condition must be satisfied for two matrices to be added together?
2. What condition must be satisfied for the product of two matrices AB to be defined?
3. How do you calculate the element in the second row, first column of the product matrix C = AB?
4. What is the transpose of a matrix, and if a matrix A is (2 \times 3), what are the dimensions of (A^T)?
5. Calculate the determinant of the matrix ( \begin{bmatrix} 2 & -1 \ 3 & 4 \end{bmatrix} ). What does a non-zero determinant imply about the matrix?

📘 Lecture 19-20 — Permutations and Combinations

📖 Overview: This lecture introduces the fundamental principles of counting, focusing on the multiplication principle, permutations, and combinations. It is essential for solving problems where you need to count the number of possible arrangements or selections, distinguishing between cases where order matters and where it does not.

🗂️ Topics Covered

The lecture begins with the multiplication principle for sequential operations. It then defines the key difference between permutations (order matters) and combinations (order does not matter). Several permutation rules are detailed, including arrangements of distinct objects, partial permutations, arrangements with identical objects, objects grouped together, and circular arrangements. The lecture concludes with the formula for combinations and its application.

📝 Lecture Summary

Multiplication Principle

If two operations A and B are performed in order, with n possible outcomes for A and m possible outcomes for B, then there are n x m possible combined outcomes of the first operation followed by the second.

📌 Example: Basket A contains a mango (m) and a banana (b). Basket B contains an apple (a), an orange (o) and a grapefruit (g). You draw one fruit from A and then one fruit from B. How many different pairs of fruits can you have? Solution: ma, mo, mg, ba, bo, bg = 6. Or, (2 from A) x (3 from B) = 6 according to the multiplication principle.

Difference Between Permutations and Combinations

Both are ways to count the possibilities. The difference between them is whether order matters or not. Consider a poker hand: A♦, 5♥, 7♣, 10♠, K♠. Is that the same hand as: K♠, 10♠, 7♣, 5♥, A♦?

• If yes, then we are dealing with permutations
• If no, then we are dealing with combinations

Permutation Rules

• To arrange n distinct objects in a row, the number of different arrangements is n! = n(n-1)(n-2)...3.2.1
• The number of different permutations of r objects which can be made from n distinct objects is given by: nPr = n! / (n-r)!
• The number of different permutations of n objects of which p are identical, q are identical, and r are identical is: n! / (p! q! r!)
• To arrange n objects in a line in which r objects have to be together, we have: r!(n – r + 1)! permutations
• To arrange n objects in a circle where arrangements are the same if obtained by rotation, we get: n!/n = (n – 1)! permutations

📌 Example 1: Suppose you have 4 pictured cards with the pictures of the letters A, B, C and D, and you want to arrange them in a row to form “words”. How many 4-letter words are there? Solution: Here we are arranging four distinct objects in a line. The number of permutations is 4! = 24.

📌 Example 2: Eight runners are hoping to take part in a race, but the track has only six lanes. In how many ways can six of the eight runners be assigned to lanes? Solution: This is a permutation of six lane assignments from 8 people: 8P6 = 8! / (8-6)! = 8! / 2! = (8.7.6.5.4.3.2.1) / (2.1) = 20160

📌 Example 3: Find the number of distinct permutations of the letters of the word MISSISSIPPI. Solution: The total number of letters = 11, Number of S’s = 4, Number of I’s = 4, Number of P’s = 2. The total number of distinct permutations is 11! / (4! 4! 2!) = 34650.

📌 Example 4: Five people, A, B, C, D and E are arranged randomly in a line. Find the possible permutations when A and B are next to each other. Solution: Imagine A and B are stuck together in the order AB. Treat them as one unit. Then there are 4 units to permute (AB, C, D and E) in a line, and we know there are 4! = 24 ways to arrange 4 units. But A and B could also be stuck together in the order BA, and there will be another 4! arrangements in that case. Therefore, there will be a total of 2 x 4! = 48 arrangements of the 5 people in the line where A and B are always together. 💡 Why this matters: This technique of treating items "stuck together" as a single unit is crucial for solving any problem where specific objects must be adjacent.

📌 Example 5: How many ways are there to sit 6 people around a circular table, where seatings are considered to be the same if they can be obtained from each other by rotating the table? Solution: First, place the first person in the north-most chair. This has only one possibility. Then place the other 5 people. There are 5P5 = 5! = 120 ways to do that. By the product rule, we get 1 x 120 = 120. Alternatively, there are 6P6 = 720 ways to seat the 6 people around the table. For each seating, there are 6 “rotations” of the seating. Thus, the final answer is 720/6 = 120.

Formula for Combinations

In general, to find the number of combinations of r objects taken from n objects, we divide the number of permutations nPr by r!. The total number of combinations is given by: 🔑 Definition — Combination: A selection of r objects from a set of n distinct objects where the order of selection does not matter. 📐 Formula: nCr = n! / [r!(n-r)!] → This counts the number of subsets of size r from a set of size n. 📌 Example: The manager of a football team has a squad of 16 players. He needs to choose 11 to play in a match. How many possible teams can be chosen? Solution: This is a combination problem as the order in which the teams are chosen is not important. The number of combinations is 16C11 = 16! / (11! 5!) = 4368.

⭐ Key Takeaways

The fundamental distinction between permutations and combinations is whether order matters; permutations are for arrangements where order is important, while combinations are for selections where it is not. The multiplication principle is the foundation for counting the outcomes of sequential operations. The key formulas are nPr = n!/(n-r)! for permutations and nCr = n!/[r!(n-r)!] for combinations. When dealing with groups of identical items, remember to divide by the factorial of the number of identical items, and for problems requiring items to be together, treat the group as a single unit. For circular arrangements, remember to divide by the number of positions (n) to account for rotational symmetry.

🧠 Quick Revision Questions

1. What is the key difference between a permutation and a combination?
2. How many distinct ways can the letters of the word "BANANA" be arranged?
3. In how many ways can a committee of 3 people be chosen from a group of 10?
4. How many ways can 5 different books be arranged on a shelf if two specific books must always be next to each other?
5. How many ways are there to seat 4 people around a circular table if rotations are considered the same?

📘 Lecture 21 — Binomial Theorem

📖 Overview: This lecture introduces the Binomial Theorem, a powerful generalization that allows us to expand expressions of the form (x + y)ⁿ for any natural number n. It covers Pascal's Triangle as a simple method for small expansions and then transitions to the general binomial coefficient formula for larger expansions.

🗂️ Topics Covered

The lecture begins by motivating the need for a generalization beyond memorized formulas for (x+y)² and (x+y)³. It introduces Pascal's Triangle as a pattern for coefficients, demonstrates its use with an example for (a + x)⁶, and then explains its inefficiency for large expansions. Finally, it presents the Binomial Theorem with its general formula using binomial coefficients and provides an example calculation.

📝 Lecture Summary

Need for Generalization

In mathematics we are always looking for generalization of ideas. For example, we know the formula for (x + y)² = x² + 2xy + y² and (x + y)³ = x³ + 3x²y + 3xy² + y³. But it is hard to remember formulas for higher powers. We need a mechanism that would help us expand (x + y)ⁿ for any values of n.

Pascal's Triangle

Pascal's Triangle is a triangular array of numbers where each value inside the triangle is obtained by adding the two values above it.

📌 Example: Expand (a + x)⁶

Solution: Remember the 5th row of the Pascal's triangle: 1 5 10 10 5 1. Coefficients of the 6th row will be: 1, 6, 15, 20, 15, 6 and 1. So expansion will be: (a + x)⁶ = a⁶ + 6a⁵x + 15a⁴x² + 20a³x³ + 15a²x⁴ + 6ax⁵ + x⁶

Connection to Binomial Coefficients

We note that the Pascal's triangle is inefficient in finding the coefficient of big expansions such as the coefficient of x⁹y⁶ in the expansion of (x + y)¹⁵. What is needed is a formula in terms of n and r for the coefficient of x^(n-r) y^r in the expansion of (x + y)ⁿ.

The n-th row is ⁿCₖ, k = 0, 1, ..., n, where:

• Row 0: ¹C₀
• Row 1: ¹C₀ ¹C₁
• Row 2: ²C₀ ²C₁ ²C₂
• Row 3: ³C₀ ³C₁ ³C₂ ³C₃
• Row 4: ⁴C₀ ⁴C₁ ⁴C₂ ⁴C₃ ⁴C₄

Binomial Theorem

Binomial Theorem: If n is a natural number, then: (x + y)ⁿ = ⁿC₀ xⁿ + ⁿC₁ x^(n-1) y + ⁿC₂ x^(n-2) y² + ⁿC₃ x^(n-3) y³ + ⁿC₄ x^(n-4) y⁴ + ... + ⁿCₙ yⁿ = Σ (from k=0 to n) ⁿCₖ x^(n-k) yᵏ

🔑 Definition — Binomial Coefficient: The binomial coefficients are given by: 📐 Formula: ⁿCᵣ = n! / [r!(n-r)!] → This gives the number of ways to choose r items from n items, which becomes the coefficient in the binomial expansion.

📌 Example: Calculate the coefficient of x¹¹y⁴ in the expansion of (x+y)¹⁵

Solution: In the term x¹¹y⁴, we have n=15, r=4 (since y has exponent 4). The coefficient is: ¹⁵C₄ = 15! / [4!(15-4)!] = 15! / [4! × 11!] = (15 × 14 × 13 × 12) / (4 × 3 × 2 × 1) = 32760/24 = 1365

💡 Why this matters: The Binomial Theorem provides a systematic, algebraic method for expanding binomials raised to any power, unlike Pascal's Triangle which is impractical for large exponents.

⭐ Key Takeaways

The Binomial Theorem generalizes the pattern observed in Pascal's Triangle into a compact formula using binomial coefficients. Pascal's Triangle works well for small expansions but becomes inefficient for large n, which is where the formula ⁿCᵣ = n!/[r!(n-r)!] becomes essential. The expansion of (x+y)ⁿ follows a clear pattern: the exponent of x decreases from n to 0 while the exponent of y increases from 0 to n, and each term's coefficient is given by the corresponding binomial coefficient. For any term x^(n-r)y^r, the coefficient is ⁿCᵣ, calculated using factorials.

🧠 Quick Revision Questions

1. Write the first 6 rows of Pascal's Triangle.
2. Use Pascal's Triangle to expand (p + q)⁵.
3. Write the general formula for the Binomial Theorem.
4. Calculate the coefficient of x⁷y⁸ in the expansion of (x+y)¹⁵.
5. Explain why Pascal's Triangle is inefficient for finding the coefficient of x⁹y⁶ in the expansion of (x+y)¹⁵.