Cover Image

An algorithm and computation to verify Legendre's Conjecture up to $3.33\cdot10^{13}$

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sorenson, Jonathan, Webster, Jonathan
Format:	Preprint
Published:	2024
Subjects:	Number Theory 11A41, 11Y16, 11Y55, 68Q25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Explicit Bounds and Parallel Algorithms for Counting Multiply Gleeful Numbers
by: Moore, Sara, et al.
Published: (2025)

Analysis of Algorithms for Moser's Problems on Sums of Consecutive Primes
by: Sorenson, Jonathan P., et al.
Published: (2025)

Advances in Tabulating Carmichael Numbers
by: Shallue, Andrew, et al.
Published: (2024)

Computation of the Totient Summatory Function
by: Brown, Lucas Augustus
Published: (2025)

Counting numbers that are divisible by the product of their digits
by: He, Qizheng, et al.
Published: (2024)

Primes and almost primes between cubes
by: Johnston, Daniel R., et al.
Published: (2026)

Computation of the least primitive root
by: McGown, Kevin J., et al.
Published: (2022)

Reducing the Space Used by the Sieve of Eratosthenes When Factoring
by: Hartman, Samuel, et al.
Published: (2024)

On the Characteristic Polynomial of Linearized Polynomials
by: Bastioni, Luca, et al.
Published: (2025)

Bounded-box reductions in the Subbarao-Warren problem for unitary perfect numbers
by: Maciejewski, Tom
Published: (2026)

Polynomially growing integer sequences all whose terms are composite
by: Ismailescu, Dan, et al.
Published: (2025)

Some results on a conjecture of de Polignac about numbers of the form $p + 2^k$
by: Chen, Yuda, et al.
Published: (2024)

Conjectures about Primes and Cyclic Numbers
by: Cohen, Joel E.
Published: (2025)

A Ceiling Continued Fraction Approach to the Erdős-Straus Conjecture: Heuristic finiteness of counterexamples
by: Ventas, Andres
Published: (2026)

Walking through the Gaussian Primes
by: Das, Madhuparna
Published: (2019)

First-hit analysis of algorithms for computing quadratic irregularity
by: Holden, Joshua
Published: (2000)

An Algorithm to Find Sums of Powers of Consecutive Primes
by: O'Sullivan, Cathal, et al.
Published: (2022)

Choosing iteration maps for the parallel Pollard rho method
by: Rudolph, Finn
Published: (2025)

A Perfect Number Generalization and Some Euclid-Euler Type Results
by: Ross, Tyler
Published: (2025)

On a remark of Serre
by: Ahrens, Katie, et al.
Published: (2025)

Rigorous methods for computational number theory
by: de Boer, Koen, et al.
Published: (2025)

Comparison of algorithms to calculate quadratic irregularity of prime numbers
by: Holden, Joshua
Published: (2000)

On the Identification of Elliptic Curves That Admit Infinitely Many Twists Satisfying the Birch-Swinnerton-Dyer Conjecture
by: Banwait, Barinder S., et al.
Published: (2026)

Locating a shortest vector in certain $2$-dimensional lattices
by: Zou, Guixian
Published: (2026)

Toda primes
by: McKean, Stephen
Published: (2025)

Deterministic polynomial factorisation modulo many primes
by: Altman, Daniel
Published: (2025)

Topographs for binary quadratic forms and class numbers
by: O'Sullivan, Cormac
Published: (2024)

Deterministic methods for finding elements of large multiplicative order
by: Harvey, David, et al.
Published: (2026)

Distribution of neighboring values of the Liouville and Möbius functions
by: Luo, Qi, et al.
Published: (2024)

Integer Sets of Large Harmonic Sum Which Avoid Long Arithmetic Progressions
by: Walker, Alexander
Published: (2022)

The first and second moment for the length of the period of the continued fraction expansion for $\sqrt{d}$
by: Battistoni, Francesco, et al.
Published: (2024)

Implementing Basic Arithmetic in $\mathbb{F}_p$ via $\mathbb{F}_2$, and Its Application for Computing the Hamming Distance of Linear Codes
by: Hernando, Fernando, et al.
Published: (2026)

Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
by: Hernando, Fernando, et al.
Published: (2016)

Algorithms for Carmichael numbers
by: Shallue, Andrew, et al.
Published: (2025)

Additive sumset sizes with tetrahedral differences
by: Nathanson, Melvyn B.
Published: (2025)

Divisors in Residue Classes Revisited
by: Hales, Jonathon
Published: (2024)

On the Existence of Integers with at Most 3 Prime Factors Between Every Pair of Consecutive Squares
by: Campbell, Peter J.
Published: (2026)

On Proving Ramanujan's Inequality using a Sharper Bound for the Prime Counting Function $π(x)$
by: De, Subham
Published: (2024)

Algorithms to Uniformly Generate Random Factored Smooth Integers
by: Bach, Eric, et al.
Published: (2020)

Explicit sumset sizes in additive number theory
by: Nathanson, Melvyn B.
Published: (2025)