A formula to compute the Nth Fibonacci number was given in Exercise 19 in Chapter 3. The formula is useful in finding a number in the sequence, but a more efficient way to output a series of numbers in the sequence is to use the recurrence relation FN = FN-1 + FN-2, with the first two numbers in the sequence F1 and F2 both defined as 1. Using this recurrence relation, we can compute the first 10 Fibonacci numbers as follows:
Write an application that accepts N, N 1, from the user and displays the first N numbers in the Fibonacci sequence. Use appropriate formatting to display the output cleanly.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.