2000 character limit reached
On Littlewood's proof of the prime number theorem
Published 18 Jun 2019 in math.NT | (1906.09906v1)
Abstract: In this note we examine Littlewood's proof of the prime number theorem. We show that this can be extended to provide an equivalence between the prime number theorem and the non-vanishing of Riemann's zeta-function on the one-line. Our approach goes through the theory of almost periodic functions and is self-contained.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.