Effective de la Valle Poussin style bounds on the first Chebyshev function

Abstract

In 1898 Charles Jean de la Valle Poussin, as part of his famed proof of the prime number theorem, developed an ineffective bound on the first Chebyshev function of the form: \[ |θ(x)-x| = O(x (-K x)). \] This bound holds for x sufficiently large, x≥ x0, and K some unspecified positive constant. To the best of my knowledge this bound has never been made effective -- I have never yet seen this bound made fully explicit, with precise values being given for x0 and K. Herein, using a number of effective results established over the past 50 years, I shall develop two very simple explicit fully effective bounds of this type: \[ |θ(x)-x| < \; x \;( - 14 x); (x≥ 2). \] \[ |θ(x)-x| < \; x \;( - 13 x); (x≥ 3). \] Many other fully explicit bounds along these lines can easily be developed. For instance one can trade off stringency against range of validity: \[ |θ(x)-x| < \; 1 2 \; x \;( - 14 x); (x≥ 29), \] \[ |θ(x)-x| < \; 1 2 \; x \;( - 13 x); (x≥ 41). \] With hindsight, some of these effective bounds could have been established almost 50 years ago.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…