An algorithm and computation to verify Legendre's conjecture up to 7 10¹³

DOI10.1007/S40993-024-00589-4MaRDI QIDQ6653358zbMATH OpenFDO

Authors Jonathan P. Sorenson, Jonathan Webster

Publication date 16 December 2024

Published in Research in Number Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S40993-024-00589-4

Mathematics Subject Classification ID

Number theory (11-XX)

Recommendations

• On Legendre's conjecture
• scientific article; zbMATH DE number 6622741
• Two algorithms to find primes in patterns
• Empirical verification of a generalization of Goldbach's conjecture
• Algorithmic Number Theory

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
• Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
• scientific article; zbMATH DE number 1643933 (Why is no real title available?)
• scientific article; zbMATH DE number 1186941 (Why is no real title available?)
• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• Large gaps between consecutive prime numbers
• 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

Cited in

(2)

• Almost primes between all squares
• New explicit and asymptotic results in sieve theory. (Abstract of thesis)

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)