Question

solve questions by using fortoran.90

6. Consider the Fibonacci series: 1 1 2 3 5 8 13 ... Each number in the series (except the first two, which are 1) is the sum from the two previous numbers. Write a program that reads in an integer limit, and which prints the first limit terms of the series. Use an nested if block structure. (You need to distinguish between several cases: limit<0, limit=1, etc.) 7. Rewrite the previous program using a case construct.

Answer 1

Hey here is answer to your question.

In case of any doubt comment below. Please UPVOTE if you Liked the answer.

PROGRAM Fibonacci
IMPLICIT NONE
INTEGER :: FIRST, SECOND, TEMP, IX
FIRST = 1
SECOND = 1
WRITE (*,*) FIRST
WRITE (*,*) SECOND
DO IX = 1, 20, 1
TEMP = FIRST + SECOND
FIRST = SECOND
SECOND = TEMP
WRITE (*,*) TEMP
END DO
END PROGRAM Fibonacci

shor <> source code PROGRAM Fibonacci IMPLICIT NONE INTEGER :: FIRST, SECOND, TEMP, IX FIRST = 1 SECOND = 1 WRITE (**) FIRST WRITE (**) SECOND DO IX = 1, 20, 1 TEMP = FIRST + SECOND FIRST = SECOND SECOND = TEMP WRITE (**) TEMP END DO 14 END PROGRAM Fibonacci 15 Scoon clear the output input Output Success #stdin #stdout Os 4352KB Wouw N W

shor <> source code PROGRAM Fibonacci IMPLICIT NONE INTEGER :: FIRST, SECOND, TEMP, IX FIRST = 1 SECOND = 1 WRITE (**) FIRST WRITE (**) SECOND DO IX = 1, 20, 1 TEMP = FIRST + SECOND FIRST = SECOND SECOND = TEMP WRITE (**) TEMP END DO 14 END PROGRAM Fibonacci 15 Scoon clear the output input Output Success #stdin #stdout Os 4352KB Wouw N W