Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Factorisation: The Fundamental Theorem of Algebra

Description

This lecture discusses the Fundamental Theorem of Algebra, stating that any polynomial equation in C has at least one solution. It explores the division of polynomials by factors, such as X - i, and demonstrates examples of complete factorization of complex coefficient polynomials. The lecture concludes by showing how complex coefficient polynomials can be factored into products of degree 1 factors, similar to prime factorization of integers.

Official source

Ontological neighbourhood

Mathematics

Algebra: Polynomials

Related concepts (28)

Polynomial

In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example with three indeterminates is x3 + 2xyz2 − yz + 1. Polynomials appear in many areas of mathematics and science.

Polynomial long division

In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalized version of the familiar arithmetic technique called long division. It can be done easily by hand, because it separates an otherwise complex division problem into smaller ones. Sometimes using a shorthand version called synthetic division is faster, with less writing and fewer calculations. Another abbreviated method is polynomial short division (Blomqvist's method).

Factorization

In mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, 3 × 5 is an integer factorization of 15, and (x – 2)(x + 2) is a polynomial factorization of x2 – 4. Factorization is not usually considered meaningful within number systems possessing division, such as the real or complex numbers, since any can be trivially written as whenever is not zero.

Factorization of polynomials

In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain. Polynomial factorization is one of the fundamental components of computer algebra systems. The first polynomial factorization algorithm was published by Theodor von Schubert in 1793. Leopold Kronecker rediscovered Schubert's algorithm in 1882 and extended it to multivariate polynomials and coefficients in an algebraic extension.

Polynomial greatest common divisor

In algebra, the greatest common divisor (frequently abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a factor of both the two original polynomials. This concept is analogous to the greatest common divisor of two integers. In the important case of univariate polynomials over a field the polynomial GCD may be computed, like for the integer GCD, by the Euclidean algorithm using long division. The polynomial GCD is defined only up to the multiplication by an invertible constant.

Related lectures (31)

Complex Numbers: Operations and Applications

Explores complex number properties, roots, and polynomial equations in the complex plane.

Complex Polynomials and Factorization

Explores complex polynomials, factorization, roots of equations, equilateral triangles, and infinite sums in sequences.

Polynomial Roots: Finding Solutions and Division

Explains how to find solutions for polynomial equations and perform polynomial division.

Polynomial Equations: Solving Methods

Covers various methods for solving polynomial equations through examples.

Complex Factorization Examples