Problem of the Week


Solutions due by 5pm on Friday, February 12.

The Fibonacci sequence is: 1, 1, 2, 3, 5, 8, 13, ...

Notice that the first two numbers are 1's, but after that, each number is the sum of the previous two.

You are given two numbers a and b, and you need to calculate how many Fibonacci numbers fall into the range [a,b]. For example, there are 3 Fibonacci numbers in the range [0,2] and there are 4 Fibonacci numbers in the range [2,10].

Hand in:
1) How many Fibonacci numbers are in the range [0,100]?
2) How many Fibonacci numbers are in the range [100,1000]?
3) What procedure you can use to compute the answer for any a and b?

For part 3: if you solve this problem via programming, just submit your code. If you do it by hand, submit English instructions that would be precise enough for anyone with basic math skills to follow.


This problem is brought to you by Dr. Lisa Torrey

Submit your solutions to Dr. Choong-Soo Lee. You may leave a hard copy in his mailbox or submit an electronic file via Dropbox.  Good luck!

Subscribe to the SLU POW electronic delivery service! You will be among the first to receive the new POW announcement each Friday. You may remove your name from the mailing list at any point by following the link in your email. The list will be used only to send messages related to the Problem of the Week.

Official Rules

Problems for Spring 2016