Tim Varley Tim Varley

Euler 010 ruby Solution

Summation of primes
Dec 12, 2015
3 minute read

Problem

https://projecteuler.net/problem=10

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.

Find the sum of all the primes below two million.

Answer: 142913828922

Solution

euler010.rb

#!/usr/bin/env ruby
require 'prime'

def sum_primes
  sieve = Prime::EratosthenesGenerator.new
  prime_sum = 0
  prime = sieve.next
  while prime <= 2_000_000
    prime_sum += prime
    prime = sieve.next
  end
  prime_sum
end

puts sum_primes if __FILE__ == $PROGRAM_NAME

See Also

# cpp go java php ruby rust javascript
1
2
3  
4    
5    
6      
7          
8          
9          
10          
11          
12          
# cpp ruby
13
14
15
16
17
18
19
20  
21  
22  
23  
24