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

Lecture

Mertens' Theorems and Mobius Function

In course

MATH-313: Number theory I.b - Analytic number theory

The aim of this course is to present the basic techniques of analytic number theory. ...

Description

This lecture discusses Mertens' theorems on prime estimates and how the prime number theorem implies the behavior of the Mobius function. The slides cover topics such as the partial sum of the Mobius function, logarithmic functions, and the application of Abel summation formula. The instructor explores the relationship between the prime number theorem and the Mobius function, providing insights into the order of the Mobius function up to x. The lecture delves into the analytical properties of Dirichlet series and their connection to arithmetic functions.

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

Official source

Ontological neighbourhood

Mathematics

Number theory: Topics in number theory

Related concepts (32)

Arithmetic function

In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n". An example of an arithmetic function is the divisor function whose value at a positive integer n is equal to the number of divisors of n.

Möbius function

The Möbius function μ(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated Moebius) in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted μ(x). For any positive integer n, define μ(n) as the sum of the primitive nth roots of unity.

Divergent series

In mathematics, a divergent series is an infinite series that is not convergent, meaning that the infinite sequence of the partial sums of the series does not have a finite limit. If a series converges, the individual terms of the series must approach zero. Thus any series in which the individual terms do not approach zero diverges. However, convergence is a stronger condition: not all series whose terms approach zero converge. A counterexample is the harmonic series The divergence of the harmonic series was proven by the medieval mathematician Nicole Oresme.

Dirichlet series

In mathematics, a Dirichlet series is any series of the form where s is complex, and is a complex sequence. It is a special case of general Dirichlet series. Dirichlet series play a variety of important roles in analytic number theory. The most usually seen definition of the Riemann zeta function is a Dirichlet series, as are the Dirichlet L-functions. It is conjectured that the Selberg class of series obeys the generalized Riemann hypothesis. The series is named in honor of Peter Gustav Lejeune Dirichlet.

Summation by parts

In mathematics, summation by parts transforms the summation of products of sequences into other summations, often simplifying the computation or (especially) estimation of certain types of sums. It is also called Abel's lemma or Abel transformation, named after Niels Henrik Abel who introduced it in 1826. Suppose and are two sequences. Then, Using the forward difference operator , it can be stated more succinctly as Summation by parts is an analogue to integration by parts: or to Abel's summation formula: An alternative statement is which is analogous to the integration by parts formula for semimartingales.

Related lectures (36)

Correlations of the Liouville function

Explores correlations of the Liouville function along deterministic and independent sequences, covering key concepts and theorems.

Elementary Algebra: Numeric Sets

Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.

Prime Numbers and Primality Testing

Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.

Möbius inversion formula

Covers the Möbius inversion formula and its proof, including the change of variables in summation.

Prime Numbers: Euclid's Theorem