Lectures related to Remainder | EPFL Graph Search

Covers number theory, division, remainder, congruence, prime numbers, integer representation, and the Euclidean algorithm.

Explores the concept of division in number theory, including properties, algorithms, and examples.

Explores the process of division euclidienne in polynomials, emphasizing the importance of polynomial degrees during operations.

Covers the calculation of limits using Taylor series and the composition of compound functions.

Covers the basic properties of holomorphic maps and Taylor series expansions in complex analysis.

Covers recent research on singular SPDEs and their applications in quantum field theory.

Explains the conversion between decimal and fractional writing, including division with remainder and a trick for periodic numbers.

Covers the Euclidean algorithm for GCD calculation and algorithmic complexity analysis.

Covers polynomial roots, factorization, and unique representation through examples of polynomial division with remainders.

Covers polynomials, their operations, division theorem, and provides illustrative examples.

Explains the Euclidean algorithm for polynomials over a field K, illustrating its application with examples.

Explains the Euclidean division of polynomials and demonstrates its application through examples and root-based divisibility.

Covers Taylor's theorem, power series, and representing functions by their Taylor series.

Covers the factorization of polynomials over a field, including division with remainder and common divisors.

Covers elliptic problems related to a model and deformation, discussing concepts such as the model problem and deformation energy.

Covers Taylor series with integral remainder for open intervals and their applications in mathematical analysis.

Covers the development of Taylor polynomials of order p around a point x.

Covers the definition of differentiable functions and explores the representation of the remainder in derivatives.

Explores the Chinese remainder theorem, systems of congruences, and Euclidean domains in integer numbers and polynomial rings.