Chebyshev's conjecture and the prime number race
From MaRDI portal
Publication:3597496
zbMATH Open1214.11105arXiv1910.08983MaRDI QIDQ3597496FDOQ3597496
Publication date: 9 February 2009
Abstract: We survey results about prime number races, that is, results about the relative sizes of prime counting functions , with fixed and varying. In particular, we describe recent work by the authors on these problems.
Full work available at URL: https://arxiv.org/abs/1910.08983
Recommendations
Research exposition (monographs, survey articles) pertaining to number theory (11-02) Primes in congruence classes (11N13)
Cited In (12)
- Limiting Properties of the Distribution of Primes in an Arbitrarily Large Number of Residue Classes
- Chebyshev’s bias for analyticL-functions
- On the race between primes with an odd versus an even sum of the last \(k\) binary digits
- Some generalizations of Chebyshev's conjecture
- Title not available (Why is that?)
- Inequities in the Shanks–Renyi prime number race over function fields
- Chebyshev's bias for products of irreducible polynomials
- Fujii’s development on Chebyshev’s conjecture
- Orderings of weakly correlated random variables, and prime number races with many contestants
- Extreme biases in prime number races with many contestants
- Exceptional biases in counting primes over function fields
- Title not available (Why is that?)
This page was built for publication: Chebyshev's conjecture and the prime number race
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597496)