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

Lecture

Arithmetic functions

Description

This lecture covers the analysis of arithmetic functions, including prime numbers, indicator functions, and completely multiplicative functions. It also discusses Dirichlet convolution, associativity, and the Riemann hypothesis.

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 (25)

Multiplicative function

In number theory, a multiplicative function is an arithmetic function f(n) of a positive integer n with the property that f(1) = 1 and whenever a and b are coprime. An arithmetic function f(n) is said to be completely multiplicative (or totally multiplicative) if f(1) = 1 and f(ab) = f(a)f(b) holds for all positive integers a and b, even when they are not coprime.

Completely multiplicative function

In number theory, functions of positive integers which respect products are important and are called completely multiplicative functions or totally multiplicative functions. A weaker condition is also important, respecting only products of coprime numbers, and such functions are called multiplicative functions. Outside of number theory, the term "multiplicative function" is often taken to be synonymous with "completely multiplicative function" as defined in this article.

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.

Dirichlet convolution

In mathematics, the Dirichlet convolution is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet. If are two arithmetic functions from the positive integers to the complex numbers, the Dirichlet convolution f ∗ g is a new arithmetic function defined by: where the sum extends over all positive divisors d of n, or equivalently over all distinct pairs (a, b) of positive integers whose product is n.

Riemann hypothesis

In mathematics, the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is of great interest in number theory because it implies results about the distribution of prime numbers. It was proposed by , after whom it is named.

Related lectures (37)

Elementary Algebra: Numeric Sets

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

Natural Numbers: Properties and Operations

Explores natural numbers, their properties, operations, and practical applications like calculating hours in a year.

Quantum Harmonic Oscillator: Path Integral Description

Explores the path integral description of the quantum harmonic oscillator and its connection to prime numbers and the Riemann Zeta-function.

The Riemann Hypothesis

Explores the Riemann Hypothesis, prime numbers, Zeta-function, and quantum mechanics.

Commutative Groups: Foundations for Cryptography