Two algorithms to find primes in patterns
From MaRDI portal
Publication:4960081
DOI10.1090/mcom/3501zbMath1461.11017arXiv1807.08777OpenAlexW2884734563MaRDI QIDQ4960081
Jonathan Webster, Jonathan P. Sorenson
Publication date: 8 April 2020
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.08777
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Primes (11A41) Primality (11Y11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Riemann's hypothesis and tests for primality
- Primality testing with Gaussian periods
- PRIMES is in P
- Prime numbers and computer methods for factorization.
- Bounded gaps between primes
- Approximate formulas for some functions of prime numbers
- Strong pseudoprimes to twelve prime bases
- Statistical Evidence for Small Generating Sets
- Sur certaines hypothèses concernant les nombres premiers
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- Long Chains of Nearly Doubled Primes
- Prime clusters and Cunningham chains
- Prime sieves using binary quadratic forms
- On the Distribution of Pseudoprimes
- Some results on pseudosquares
- Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures
- Integers free of small prime factors in arithmetic progressions
- An improved sieve of Eratosthenes
- Algorithmic Number Theory
- Algorithmic Number Theory
- Unsolved problems in number theory
This page was built for publication: Two algorithms to find primes in patterns
