The Fibonacci numbers are defined by the sequence
Reformulate that as
fold₁ = 1;
fold₂ = 1;
f_new = fold₁ + fold₂;
After that, discard fold₂, which is no longer needed, and set fold₂ to fold₁ and fold₁ to f_new. Repeat an appropriate number of times. Implement a program that prompts the user for an integer n and prints the n^th Fibonacci number, using the above algorithm.

Transcribed Image Text:

f = 1 f2 = 1 fn = fn-1+ fn-2 ガ-2