6.2 Fibonacci Series

6.2 Fibonacci Series

This program will probably use the for loop.

The series starts with a zero(0) and a one(1). Each subsequent number is the sum of the previous two numbers.

So:

• 0 (Given)
• 1 (Given)
• 1 (0+1)
• 2 (1+1)
• 3 (1+2)
• 5 (2+3)
• ...
• F_n (F_n-2+F_n-1)

Number the first number in the series, the zero with a zero. With this numbering LCD(F_n,F_m) = F(LCD(n,m)).

Your program need to print the following:

• Your name
• CIS265 Louis Taber
• Lab: 6.2: Fibonacci Series
• A table that includes:
  • Sequence number
  • Fibonacci number

Other requirements:

• Use a #define for the initial number of robots and the end point constants.
• Use a printf format string of
  " %6d %6d\n"

1. Do NOT use recursion. Write an iterative program.

Study areas:

• Compound/Block structure. Hanly & Koffman Section 4.1 page 146.   Kernighan p55. Harbison p236-238.
•   for statement. Hanly & Koffman page 220. Kernighan p13 & p60. Harbison p243-247.
•   printf() function. Hanly & Koffman pages 48-50 and pages 598-600. Kernighan p7, p11, & p153. Harbison p366+.

Extra credit:

• Print out the prime factors of each of the Fibonacci numbers.

Make sure that your program run sand prints the twenty-first Fibonacci number. Mark your output with:

• Your name
• TABER CIS265
• Lab 6.2: Fibonacci Series
• The compiler and OS that you used.
• The size in bytes of the executable program

6.2 Fibonacci Series