Reply
Sat 15 Mar, 2008 06:01 am
The Fibonacci sequence of numbers is defined as:
F[0]=0
F[1]=1
and for all x>1,
F[x]=F[x-1]+F[x-2]
Hence the sequence goes 0,1,1,2,3,5,8,13,21,...
The problem:
What is the smallest value of x>0 such that F[x]=0 mod 2^32
This looks more like your math homework than a riddle. Riddles require guesswork and lateral thinking. Your question just requires something you maybe don't like, namely work.
i thought a mod b = remainder after a is divided by b.....since a is 0, then anything u divide into 0 is 0......or am i missing something?
Here is the solution with the digits in increasing order.
1222223457
You just need to figure out the correct order. There are only 30,240 possibilities to consider.
Also, spell his name right. It's Fibonacci.
Stumble It!
Tweet This
Bookmark on Delicious
Share on Facebook
Share on MySpace