Skip to main content

On the number of false witnesses for a composite number

  • 1452 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 1240)

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

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Baillie and S.S. Wagstaff, Jr., Lucas pseudoprimes, Math. Comp. 35 (1980), 1391–1417.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. A. Balog, p+a without large prime factors, Séminaire de Théorie des Nombres de Bordeaux (1983–84), no. 31.

    Google Scholar 

  3. L. Monier, Evaluation and comparison of two efficient probabilistic primality testing algorithms, Theoretical Comp. Sci. 12 (1980), 97–108.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. C. Pomerance, Recent developments in primality testing, Math. Intelligencer 3 (1981), 97–105.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. C. Pomerance, On the distribution of pseudoprimes, Math. Comp. 37 (1981), 587–593.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. C. Pomerance, A new lower bound for the pseudoprime counting function, Illinois J. Math. 26 (1982), 4–9.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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