Tag Archives: Legendre

Use Euler’s Sieve to find prime numbers in C#

The Sieve of Eratosthenes is a simple way to make a list of prime numbers. The basic idea is to make an array of numbers. Starting with 2, cross out all multiples of 2 greater than 2. Next cross out … Continue reading

Posted in algorithms, mathematics | Tagged , , , , , , , , , , , , | 6 Comments