Abstract

A prime number is a natural number that is not divisible without remainder by any other natural number but 1 and itself. Primes are scattered irregularly among the set of natural numbers, and this fact has fascinated mathematicians throughout the centuries. Today, primes are not only a challenge for mathematicians, but are of very practical value – for instance, they play a central role in cryptography. In this chapter the authors explain a very old, but still practical algorithm for computing a table with all prime numbers up to a specified number.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.