Advertisement

Miscellany

  • Lawrence C. Washington
Part of the Graduate Texts in Mathematics book series (GTM, volume 83)

Abstract

Suppose n is a large odd number that we want to test for primality. A standard procedure is to compute, for example, 2n-1 (mod n). If the answer is not 1 (mod n), then n is composite, and if the answer is 1 (mod n), we suspect n might be prime.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Lawrence C. Washington
    • 1
  1. 1.Mathematics DepartmentUniversity of MarylandCollege ParkUSA

Personalised recommendations