An expository review of the Chebyshev-Sylvester method in prime number theory

TL;DR

This expository and computational study revisits the Chebyshev–Sylvester elementary method for bounding the prime-counting function via the Chebyshev function $\psi(x)$ and the summatory logarithm $T(x)$. By replacing the Möbius function with finitely supported surrogates $\nu$, it builds an initial linear bound and a framework $V(x)$, $E(x)$ to relate $\psi$ to $T$, then applies Sylvester's iterative bootstrapping to progressively sharpen the constants. The work provides a detailed computational optimization pipeline, including term-selection heuristics governed by a ratio parameter $\rho$, and demonstrates substantial improvements across Chebyshev’s and Sylvester’s schemes, including gigantic ones ($\nu_7$, $\nu_8$). While superseded by complex-analytic proofs for PNT, the approach remains a valuable, fully explicit pedagogical tool for elementary analytic number theory and for verifying historical bounds with modern computation.

Abstract

This paper provides a detailed expository and computational account of the elementary methods developed by P. L. Chebyshev and J. J. Sylvester to establish explicit bounds on the prime counting function. The core of the method involves replacing the Möbius function with a finitely supported arithmetic function in the convolution identities, relating the Chebyshev function psi(x) to the summatory logarithm function T(x) = log([x]!). We present a comprehensive analysis of the various schemes proposed by Chebyshev and Sylvester, with a central focus on Sylvester's innovative iterative refinement procedure. By implementing this procedure computationally, we replicate, verify, and optimize the historical results, providing a self-contained pedagogical resource for this pivotal technique in analytic number theory.

Figures (20)

• Figure 1: $E(x)$ for Chebyshev's scheme.
• Figure 2: Expanding $V(x)$ in terms of $\psi(x/n)$.
• Figure 3: Derivation of the estimates \ref{['e:cheb-est-1']}.
• Figure 4: The $E$-functions for $\nu_1$, $\nu_2$, and $\nu_3$.
• Figure 5: The $E$-functions for $\nu_4$, $\nu_5$, and $\nu_6$.

Theorems & Definitions (14)

• Lemma 2.1
• Lemma 2.2
• proof
• Lemma 2.3
• proof
• Theorem 3.1
• proof
• Example 3.2
• Remark 3.3
• Remark 3.4