Lecture

Primes in arithmetic progressions (II), and Gamma functions

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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

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.