Keywords
- Maximal Order
- Counting Function
- Hungarian Academy
- Testing Algorithm
- Asymptotic Density
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Baillie and S.S. Wagstaff, Jr., Lucas pseudoprimes, Math. Comp. 35 (1980), 1391–1417.
A. Balog, p+a without large prime factors, Séminaire de Théorie des Nombres de Bordeaux (1983–84), no. 31.
L. Monier, Evaluation and comparison of two efficient probabilistic primality testing algorithms, Theoretical Comp. Sci. 12 (1980), 97–108.
C. Pomerance, Recent developments in primality testing, Math. Intelligencer 3 (1981), 97–105.
C. Pomerance, On the distribution of pseudoprimes, Math. Comp. 37 (1981), 587–593.
C. Pomerance, A new lower bound for the pseudoprime counting function, Illinois J. Math. 26 (1982), 4–9.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag
About this paper
Cite this paper
Erdös, P., Pomerance, C. (1987). On the number of false witnesses for a composite number. In: Chudnovsky, D.V., Chudnovsky, G.V., Cohn, H., Nathanson, M.B. (eds) Number Theory. Lecture Notes in Mathematics, vol 1240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0072975
Download citation
DOI: https://doi.org/10.1007/BFb0072975
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17669-5
Online ISBN: 978-3-540-47756-3
eBook Packages: Springer Book Archive
