On coefficients satisfying Chebyshev's approximation of $\pi(x)$

TL;DR

This paper explores Chebyshev's initial bounds for the prime counting function, focusing on the properties of coefficients that satisfy certain approximation conditions related to $\pi(x)$ and $\psi(x)$.

Contribution

It highlights an under-expressed fact about Chebyshev's coefficients and their role in approximating the prime counting function using specific linear combinations.

Findings

Identifies conditions on coefficients for Chebyshev's bounds

Shows how these coefficients relate to approximating $\pi(x)$ and $\psi(x)$

Provides insights into the structure of Chebyshev's inequalities

Abstract

We note an interesting and under-expressed fact from Chebyshev's initial bounding for the prime counting function, $\pi(x) := \# \{p \leq x : p \text{ prime}\},$ based upon a selection of fixed coefficients $d\in D$ to show $\psi(x) \asymp x$, and thus the goal of choosing some $a(d)$ approximately the same as $\mu(d)$ such that: $$ \sum_{d}\frac{a(d)}{d} = 0, \quad \wedge \quad -\sum_{d}\frac{a(d)\log d}{d} \approx 1.$$