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

Lecture

Summation Formulas of Arithmetic Functions

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 covers the application of the method of convolution, the Dirichlet hyperbola method, and the 'large value' of the divisor function tau(n). The slides discuss the existence of a constant Cxo in the error term for the sum of the divisor function, the method of convolution, and the interchange of the order of sum. The lecture also explores the Dirichlet hyperbola method and its application in obtaining a good error term for the sum of the divisor function. Additionally, it delves into the large value of the divisor function tau(n) and the application of the same method to other 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

Related concepts (18)

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.

Divisor function

In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number of divisors of an integer (including 1 and the number itself). It appears in a number of remarkable identities, including relationships on the Riemann zeta function and the Eisenstein series of modular forms. Divisor functions were studied by Ramanujan, who gave a number of important congruences and identities; these are treated separately in the article Ramanujan's sum.

Divisor

In mathematics, a divisor of an integer , also called a factor of , is an integer that may be multiplied by some integer to produce . In this case, one also says that is a multiple of An integer is divisible or evenly divisible by another integer if is a divisor of ; this implies dividing by leaves no remainder. An integer n is divisible by a nonzero integer m if there exists an integer k such that . This is written as Other ways of saying the same thing are that m divides n, m is a divisor of n, m is a factor of n, and n is a multiple of m.

Average order of an arithmetic function

In number theory, an average order of an arithmetic function is some simpler or better-understood function which takes the same values "on average". Let be an arithmetic function. We say that an average order of is if as tends to infinity. It is conventional to choose an approximating function that is continuous and monotone. But even so an average order is of course not unique. In cases where the limit exists, it is said that has a mean value (average value) .

Greatest common divisor

In mathematics, the greatest common divisor (GCD) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers x, y, the greatest common divisor of x and y is denoted . For example, the GCD of 8 and 12 is 4, that is, . In the name "greatest common divisor", the adjective "greatest" may be replaced by "highest", and the word "divisor" may be replaced by "factor", so that other names include highest common factor (hcf), etc.

Related lectures (27)

Möbius inversion formula

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

Prime Numbers: Deterministic Approaches

Introduces deterministic approaches to identify prime numbers and covers algorithms and modular arithmetic for prime number testing.

Fundamental Theorem of Arithmetic

Covers prime numbers, unique decomposition of natural numbers into prime factors, and practical implications for calculations.

Meromorphic Functions & Differentials

Explores meromorphic functions, poles, residues, orders, divisors, and the Riemann-Roch theorem.

Number Theory: GCD and LCM