Prime Running Functions
From MaRDI portal
Publication:5056340
DOI10.1080/10586458.2020.1786863OpenAlexW3037971443MaRDI QIDQ5056340
Publication date: 8 December 2022
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.13355
Cites Work
- Highly biased prime number races
- On the Shanks-Rényi race problem mod 5
- Mertens' theorem for arithmetic progressions
- A note on Mertens' formula for arithmetic progressions
- Cramér vs. Cramér. On Cramér's probabilistic model for primes
- Biases in the Shanks—Rényi Prime Number Race
- On the primality of $n! \pm 1$ and $2 \times 3 \times 5 \times \dotsm \times p \pm 1$
- Comparative prime-number theory. I
- Chebyshev's Bias
- Harald Cramér and the distribution of prime numbers
- Prime Number Races
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Prime Running Functions