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

Lecture

Binomial Formula, Euler Number, Infinity

In course

MATH-101(de): Analysis I (German)

Es werden die Grundlagen der Analysis sowie der Differential- und Integralrechnung von Funktionen einer reellen Veränderlichen erarbeitet. ...

Description

This lecture covers the binomial formula, the Euler number, and the concept of infinity. It explains the induction assumption, the proof by induction, and the convergence of sequences. The instructor demonstrates the properties of the Euler number and divergent sequences.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (3)

Daniel Kressner

Tobias Johannes Schmid

Joachim Krieger

Official source

Related concepts (32)

Mathematical induction

Mathematical induction is a method for proving that a statement is true for every natural number , that is, that the infinitely many cases all hold. Informal metaphors help to explain this technique, such as falling dominoes or climbing a ladder: Mathematical induction proves that we can climb as high as we like on a ladder, by proving that we can climb onto the bottom rung (the basis) and that from each rung we can climb up to the next one (the step). A proof by induction consists of two cases.

Binomial theorem

In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial. According to the theorem, it is possible to expand the polynomial (x + y)n into a sum involving terms of the form axbyc, where the exponents b and c are nonnegative integers with b + c = n, and the coefficient a of each term is a specific positive integer depending on n and b. For example, for n = 4, The coefficient a in the term of axbyc is known as the binomial coefficient or (the two have the same value).

Binomial series

In mathematics, the binomial series is a generalization of the polynomial that comes from a binomial formula expression like for a nonnegative integer . Specifically, the binomial series is the Taylor series for the function centered at , where and . Explicitly, where the power series on the right-hand side of () is expressed in terms of the (generalized) binomial coefficients If α is a nonnegative integer n, then the (n + 2)th term and all later terms in the series are 0, since each contains a factor (n − n); thus in this case the series is finite and gives the algebraic binomial formula.

Structural induction

Structural induction is a proof method that is used in mathematical logic (e.g., in the proof of Łoś' theorem), computer science, graph theory, and some other mathematical fields. It is a generalization of mathematical induction over natural numbers and can be further generalized to arbitrary Noetherian induction. Structural recursion is a recursion method bearing the same relationship to structural induction as ordinary recursion bears to ordinary mathematical induction.

Sequence

In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called elements, or terms). The number of elements (possibly infinite) is called the length of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers (the positions of elements in the sequence) to the elements at each position.

Related lectures (46)

Real Analysis: Sequences and Limits

Covers real sequences, induction, limits, and convergence in mathematical analysis.

Newton's Binomial and Real Sequences

Explores Newton's binomial theorem and real sequences with examples and definitions.

Geometric Series: Convergence and Applications

Explores the convergence of geometric series and their applications in real-world problems.

Cartesian Product and Induction

Introduces Cartesian product and induction for proofs using integers and sets.

Uniform Integrability and Convergence