prime fibonaccis

gistfile1.txt

require 'prime'

class Prime
	def self.fib(n)
		if n == 0
			return 0
		end
		(2..n).reduce([0,1]) do |total, n|
			total << total[-1] + total[-2]
		end
	end
	def self.primes(n)
		Prime.first n
	end
end


Prime.fib(30).each do |n|
	if Prime.prime?(n)
		puts "#{n} (prime)"
	else
		puts n
	end
end