Counting composites with two strong liars

DOI10.1090/mcom/2949zbMath1330.11079arXiv1308.0880OpenAlexW2151646231MaRDI QIDQ5501162

Eric Bach, Andrew Shallue

Publication date: 13 August 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Primality (11Y11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• On the normal number of prime factors of \(\phi(n)\)
• Zur additiven Zahlentheorie. II
• Two contradictory conjectures concerning Carmichael numbers
• Average Case Error Estimates for the Strong Probable Prime Test
• A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
• Faster Integer Multiplication
• On the Number of False Witnesses for a Composite Number
• The large sieve
• Algorithmic Number Theory
• A Simple Proof of a Theorem of Landau

This page was built for publication: Counting composites with two strong liars