antimon2 · September 7, 2012 09:12
diff --git a/project_euler_47.rb b/project_euler_47.rb
 require 'prime'

 def project_euler_47 n=4
  return if n < 2
  Prime.each_cons(2) do |p1, p2|
    nums = ((p1+1)...p2).select{|m|m.prime_division.size==n}
    idx = 0.upto(nums.size-n).find{|i|nums[i+n-1]==nums[i]+n-1}
    return nums[idx] if idx
  end
 end

 if $0 == __FILE__
  p project_euler_47
 end
	require 'prime'

	def project_euler_47 n=4
	return if n < 2
	Prime.each_cons(2) do \|p1, p2\|
	nums = ((p1+1)...p2).select{\|m\|m.prime_division.size==n}
	idx = 0.upto(nums.size-n).find{\|i\|nums[i+n-1]==nums[i]+n-1}
	return nums[idx] if idx
	end
	end

	if $0 == __FILE__
	p project_euler_47
	end
No results found