[ create a new paste ] login | about

Link: http://codepad.org/zOatd6NO    [ raw code | output | fork ]

Ruby, pasted on Aug 27:
def is_prime(n)
  return false if n <= 1
  2.upto(Math.sqrt(n).to_i) do |x|
    return false if n%x == 0
  end
  true
end

def fib(n)
	if n == 0
		return 0
	elsif n == 1
		return 1
	else
		return fib(n-1) + fib(n-2)
	end
end

def get_fib_prime(n)
	i = 0
	while fib(i) < n
		i += 1
	end
	i2 = i
	while is_prime(fib(i2)) == false
		i2 += 1
	end
	puts fib(i2)
end

get_fib_prime(45)


Output:
1
89


Create a new paste based on this one


Comments: