NUMBER_OF_PRIMES = 150000
primes = [2]
test_number = 2
primes_found = 0

while primes_found < NUMBER_OF_PRIMES
  test_primitiveness = true
  i = 0
  while (primes.size > i && primes[i] <= Math.sqrt(test_number) && test_primitiveness)
    if test_number % primes[i] == 0
      test_primitiveness = false
    end
    i += 1
  end
  if test_primitiveness
    primes << test_number
    primes_found += 1
  end
  test_number += 1
end