Hackety Hacking Problem Family Tree FibonacciSeries: Difference between revisions
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
Fibonacci Series :- |
Fibonacci Series :- |
||
It is the series which starts with 0 & 1 and after that every no is the sum of previous two numbers in the series.In mathematical form we can say |
It is the series which starts with 0 & 1 and after that every no is the sum of previous two numbers in the series.In mathematical form we can say |
||
for n<=2 |
for n<=2 |
||
Revision as of 11:18, 12 October 2007
Problem Statement
Write a program to print the fibonacci series till 'n' no terms.
Fibonacci Series :- It is the series which starts with 0 & 1 and after that every no is the sum of previous two numbers in the series.In mathematical form we can say
for n<=2
F1=0 F2=1
for n>2
Fn=Fn-1 + Fn-2
Sample Output
Enter the no of terms to be printed : 10 The Fibonacci Series is : 0 ,1 ,1 ,2 ,3 ,5 ,8 ,13 ,21 ,34
Curriculum Connection
To solve this problem students will
- Take input from user
- Will first check the nature of problem
- Simulates the mathematical function using loops
- Simulation will require nesting of loops
- Print the output
Soltion in RUBY
Will be given soon.......