Squarefree smooth numbers and Euclidean prime generators

DOI10.1090/proc/13576zbMath1437.11007arXiv1607.01557OpenAlexW2964290480MaRDI QIDQ4592730

Andrew R. Booker, Carl B. Pomerance

Publication date: 8 November 2017

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.01557

zbMATH Keywords

smooth numbersEuclidean prime generators

Mathematics Subject Classification ID

Estimates on character sums (11L40) Arithmetic progressions (11B25) Power residues, reciprocity (11A15) Primes (11A41)

Related Items (5)

Square-free smooth polynomials in residue classes and generators of irreducible polynomials ⋮ Subproducts of small residue classes ⋮ Energy bounds, bilinear forms and their applications in function fields ⋮ SMOOTH SQUAREFREE AND SQUAREFULL INTEGERS IN ARITHMETIC PROGRESSIONS ⋮ On smooth square‐free numbers in arithmetic progressions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of the Pólya-Vinogradov inequality
• On distinguishing prime numbers from composite numbers
• Optimal representations by sumsets and subset sums
• Approximate formulas for some functions of prime numbers
• The least quadratic non residue
• The Primes that Euclid Forgot
• Remarks on the Pólya–Vinogradov Inequality
• A variant of the Euclid-Mullin sequence containing every prime
• A Superpowered Euclidean Prime Generator
• Integers without large prime factors in short intervals and arithmetic progressions
• On Mullin's Second Sequence of Primes
• Fixed Points for Discrete Logarithms
• Conditional bounds for the least quadratic non-residue and related problems
• The Schnirelmann Density of the Squarefee Integers
• On A Theorem Equivalent to Post's Fundamental Theorem of Recursive Function Theory
• On Artin's conjecture.

This page was built for publication: Squarefree smooth numbers and Euclidean prime generators