Tag Archives: Primes
The Sieve of Atkin in C#
I have previously written about the Sieve of Eratosthenes, which is an algorithm for finding primes. This algorithm worked very well for most of the prime related Euler Problems. However, for one of them it just didn’t do it. Well, … Continue reading
The Sieve of Eratosthenes in C#
In some of the Project Euler problems we have needed a source of primes. One algorithm for finding primes is called the Sieve of Eratosthenes. This algorithm is both pretty simple to understand and to implement. It is also fairly … Continue reading
Posted in Project Euler, Software Development
Tagged C#, Primes, Sieve of Eratosthenes
Leave a comment
Project Euler: Problem 10
The sum of the primes below 10 is Find the sum of all the primes below two million.
Project Euler: Problem 7
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st prime number?
Project Euler: Problem 3
The third Euler problem has to do with prime factorization: The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143?
