An algorithm and computation to verify Legendre's conjecture up to 7 10¹³
From MaRDI portal
Publication:6653358
Recommendations
Cites work
- Algorithmic Number Theory
- An improved sieve of Eratosthenes
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Dissecting a sieve to cut its need for space
- Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
- Introduction to analytic number theory
- Large gaps between consecutive prime numbers
- Prime numbers. A computational perspective
- Prime sieves using binary quadratic forms
- Primes between consecutive powers
- PRIMES is in P
- Proving primality in essentially quartic random time
- Some results on pseudosquares
- The difference between consecutive primes. II
- Trading time for space in prime number sieves
Cited in
(2)
This page was built for publication: An algorithm and computation to verify Legendre's conjecture up to \(7\cdot 10^{13}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653358)