Lecture

Arithmetic Functions: Multiplicative Functions and Dirichlet Convolution

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 introduces arithmetic functions, covering topics such as multiplicative functions, Dirichlet convolution, inversion of arithmetic functions, and the definition of the Mobius function. It explains the properties and notation related to arithmetic functions, emphasizing their importance in number theory.

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.

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.

Prime omega function

In number theory, the prime omega functions and count the number of prime factors of a natural number Thereby (little omega) counts each distinct prime factor, whereas the related function (big omega) counts the total number of prime factors of honoring their multiplicity (see arithmetic function). That is, if we have a prime factorization of of the form for distinct primes (), then the respective prime omega functions are given by and . These prime factor counting functions have many important number theoretic relations.

Related lectures (32)

Möbius inversion formula

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

Mertens' Theorems and Mobius Function

Explores Mertens' theorems on prime estimates and the behavior of the Mobius function in relation to the prime number theorem.

Prime Gaps and Multiplicative Sieve Inequalities

Covers the Bombieri-Vinogradov theorem and its implications for prime gaps and multiplicative sieve inequalities.

Arithmetic functions

Covers the analysis of arithmetic functions, including prime numbers and the Riemann hypothesis.

Integers: Well Ordering and Induction