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

Lecture

Integration by Recurrence

Description

This lecture covers the concept of integration by recurrence, demonstrating the process through various examples involving square roots and different polynomial functions. The instructor explains the step-by-step method to solve integrals using recurrence relations and provides insights into the mathematical reasoning behind this technique.

In MOOCs (2)

Analysis I

Analysis I (part 7) : Indefinite and definite integrals, integration (selected chapters)

Official source

Quiz

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (29)

Chebyshev polynomials

The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as and . They can be defined in several equivalent ways, one of which starts with trigonometric functions: The Chebyshev polynomials of the first kind are defined by Similarly, the Chebyshev polynomials of the second kind are defined by That these expressions define polynomials in may not be obvious at first sight, but follows by rewriting and using de Moivre's formula or by using the angle sum formulas for and repeatedly.

Laguerre polynomials

In mathematics, the Laguerre polynomials, named after Edmond Laguerre (1834–1886), are solutions of Laguerre's differential equation: which is a second-order linear differential equation. This equation has nonsingular solutions only if n is a non-negative integer. Sometimes the name Laguerre polynomials is used for solutions of where n is still a non-negative integer. Then they are also named generalized Laguerre polynomials, as will be done here (alternatively associated Laguerre polynomials or, rarely, Sonine polynomials, after their inventor Nikolay Yakovlevich Sonin).

Legendre polynomials

In mathematics, Legendre polynomials, named after Adrien-Marie Legendre (1782), are a system of complete and orthogonal polynomials with a vast number of mathematical properties and numerous applications. They can be defined in many ways, and the various definitions highlight different aspects as well as suggest generalizations and connections to different mathematical structures and physical and numerical applications. Closely related to the Legendre polynomials are associated Legendre polynomials, Legendre functions, Legendre functions of the second kind, and associated Legendre functions.

Orthogonal polynomials

In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to each other under some inner product. The most widely used orthogonal polynomials are the classical orthogonal polynomials, consisting of the Hermite polynomials, the Laguerre polynomials and the Jacobi polynomials. The Gegenbauer polynomials form the most important class of Jacobi polynomials; they include the Chebyshev polynomials, and the Legendre polynomials as special cases.

Square root

In mathematics, a square root of a number x is a number y such that ; in other words, a number y whose square (the result of multiplying the number by itself, or ) is x. For example, 4 and −4 are square roots of 16 because . Every nonnegative real number x has a unique nonnegative square root, called the principal square root, which is denoted by where the symbol "" is called the radical sign or radix. For example, to express the fact that the principal square root of 9 is 3, we write .

Related lectures (51)

Algebraic Functions: Two Gendarmes MOOC: Analysis I MOOC: Analysis I (part 4) : Limit of a function, continuous functions

Explores algebraic functions, limits, and behavior as x approaches infinity.

Integration: Simple Elements MOOC: Analysis I MOOC: Analysis I (part 7) : Indefinite and definite integrals, integration (selected chapters)

Covers the integration of simple elements using various techniques to solve integration problems.

Attack on RSA using LLL

Covers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.

Complex Roots: Conjugate Pairs and Quadratic Equations

Explores complex roots, conjugate pairs, and quadratic equations solving strategies.

Second Degree Trinomial: Roots and Formulas