9May/092
Project Euler: Problem 25 in Ruby
Skipping around a bit, I saw that #25 looked pretty easy. It was. I saw in the forums that someone had used binary search and a calculator which I thought was pretty clever, but mine was just brute force.
What is the first term in the Fibonacci sequence to contain 1000 digits?
Solution
max = 10 ** 999 a, b, i = 1, 1, 2 while b < max i += 1 a, b = b, b + a end puts i




























February 2nd, 2010 - 01:37
I just needed to say that I found your site via Goolge and I am glad I did. Keep up the good work and I will make sure to bookmark you for when I have more free time away from the books. Thanks again!
July 6th, 2011 - 03:58
6. Very nice post. I just stumbled upon your weblog and wanted to say that I have really enjoyed surfing around your blog posts. After all I will be subscribing to your feed and I hope you write again very soon!