Lecture

Primes in arithmetic progressions (II), and Gamma functions

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.

Description

This lecture delves into the existence of infinitely many primes in arithmetic progressions, presenting the idea of proof using Dirichlet's theorem. It also covers the Euler gamma function, defining it and discussing its properties, such as being an analytic function with simple poles at specific points. The lecture explores various corollaries related to the gamma function, including duplication and reflection formulas, and touches on Hadamard's factorization theorem.

Official source

Ontological neighbourhood

Mathematics

Analysis: Complex analysis

Number theory: Topics in number theory

Related concepts (32)

Gamma function

In mathematics, the gamma function (represented by Γ, the capital letter gamma from the Greek alphabet) is one commonly used extension of the factorial function to complex numbers. The gamma function is defined for all complex numbers except the non-positive integers. For every positive integer n, Derived by Daniel Bernoulli, for complex numbers with a positive real part, the gamma function is defined via a convergent improper integral: The gamma function then is defined as the analytic continuation of this integral function to a meromorphic function that is holomorphic in the whole complex plane except zero and the negative integers, where the function has simple poles.

Prime number

A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4.

Prime number theorem

In mathematics, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann (in particular, the Riemann zeta function).

Analytic function

In mathematics, an analytic function is a function that is locally given by a convergent power series. There exist both real analytic functions and complex analytic functions. Functions of each type are infinitely differentiable, but complex analytic functions exhibit properties that do not generally hold for real analytic functions. A function is analytic if and only if its Taylor series about converges to the function in some neighborhood for every in its domain.

Reciprocal gamma function

In mathematics, the reciprocal gamma function is the function where Γ(z) denotes the gamma function. Since the gamma function is meromorphic and nonzero everywhere in the complex plane, its reciprocal is an entire function. As an entire function, it is of order 1 (meaning that log log grows no faster than log ), but of infinite type (meaning that log grows faster than any multiple of , since its growth is approximately proportional to log in the left-half plane).

Related lectures (64)

Hadamard Factorisation

Covers the Hadamard factorisation theorem for entire functions of order at most 1.

Elementary Algebra: Numeric Sets

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

Dedekind Function: Analytic Continuation and Euler Product Formula

Covers the Dedekind function, Euler product formula, series convergence, and analytic continuation of logarithmic functions.

Prime Numbers and Primality Testing

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

Primes in Arithmetic Progression