Done puzzle 64

[project-euler.git] / euler7.rb

primes = Array.new

2.upto 2000000 do |i|
  primes << i
end

n = 0
while primes[n] ** 2 <= primes[-1]

  primes.reject! {|i| i % primes[n] == 0 and i > primes[n]}
  n = n+1
end

puts "found#{primes.length} primes"
puts "100th prime is #{primes[99]}"