What is recorded here?
The1852 memoir replaces prime-table conjectures with quantitative bounds on weighted prime counts and uses them to prove Bertrand’s interval claim beyond the finite range covered by tables. A table can show many examples of primes between a number and roughly twice that number, but it cannot rule out an exception farther away. Chebyshev links the logarithm of a factorial to sums over primes and prime powers, then bounds those sums. That turns a pattern in a table into a statement about every sufficiently large input. He closes the remaining finite cases using prime tables, preserving Bertrand’s role in posing the conjecture. The bounds also constrain how many primes occur, while remaining weaker than the exact asymptotic relation proved later in the prime number theorem.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
The target is quantitative upper/lower weighted-prime and interval-count bounds and the original Bertrand proof for integer a>3: a prime lies strictly between a and 2 a−2. Original 381–382 treats a>160 analytically and smaller admissible integers by prime tables; finite table checks alone do not prove the infinite range. Theta sums natural logarithms over primes up to x, distinct from the auxiliary prime-power sum. These bounds do not prove pi(x)~x/log(x), a zero-free zeta theorem or general primes in every shorter interval. Later series applications impose positivity/monotonicity conditions and are not advertised here as universal convergence criteria. no independent full proof replay. Presentation 1850 and publication 1852 are distinguished without duplicate counting.
Read the original work
- Tchebichef, Mémoire sur les nombres premiers (1852), original366–390
- Numdam/BnF Mathdoc catalogue of the1852 Tchebichef memoir
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Tchebichef (Chebyshev)
Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Chebyshev: rigorous bounds on how often primes appear
The1852 memoir replaces prime-table conjectures with quantitative bounds on weighted prime counts and uses them to prove Bertrand’s interval claim beyond the finite range covered by tables.
A table can show many examples of primes between a number and roughly twice that number, but it cannot rule out an exception farther away. Chebyshev links the logarithm of a factorial to sums over primes and prime powers, then bounds those sums. That turns a pattern in a table into a statement about every sufficiently large input. He closes the remaining finite cases using prime tables, preserving Bertrand’s role in posing the conjecture. The bounds also constrain how many primes occur, while remaining weaker than the exact asymptotic relation proved later in the prime number theorem.
Scientific scope
The target is quantitative upper/lower weighted-prime and interval-count bounds and the original Bertrand proof for integer a>3: a prime lies strictly between a and 2 a−2. Original 381–382 treats a>160 analytically and smaller admissible integers by prime tables; finite table checks alone do not prove the infinite range. Theta sums natural logarithms over primes up to x, distinct from the auxiliary prime-power sum. These bounds do not prove pi(x)~x/log(x), a zero-free zeta theorem or general primes in every shorter interval. Later series applications impose positivity/monotonicity conditions and are not advertised here as universal convergence criteria. no independent full proof replay. Presentation 1850 and publication 1852 are distinguished without duplicate counting.
People and systems
Tchebichef (Chebyshev)