The Fibonacci sequence is a series of numbers where each subsequent number is the sum of the previous two. It was introduced to Western mathematics in 1202 but was originally created by Indian mathematicians 1300 years ago. The sequence follows the pattern: 1, 1, 2, 3, 5, 8, 13, 21, etc. To generate each new number, you add the two numbers before it - for example, 1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5 and so on. The Fibonacci algorithm uses variables P, C, and N - where P stores the previous number, C the current number, and N calculates the next number as P + C.

1. Fibonacci series?

2. Introduction Fibonacci series
First introduced the Fibonacci sequence to the
west in 1202.
The sequence was first created by mathematicians
In India 1300 year ago.

3. Example of Fibonacci series
1 1 2 3 5 8 13 21…..

4. Logic of Fibonacci series
1+1+2+3+5+8+13+21…..
every next number is generated by sum
up the previous two number
Like this 1+1=2
1+2=3
2+3=5

5. P=C, C=N
What is this
Let see
P mean previous number, C mean current number
And N next number.
let see on next slide

6. P=1,C=1 so N will become 2
P=C,C=N
P + C = N
1 + 1 = 2
P + C = N
1 + 2 = 3
P + C
2 + 3 = 5

7. p is used to store previous value, c for current
and n for calculating the next number in
Fibonacci series
Fibonacci series in algorithm
Step1: set p=1,C=1
Step2: N=P+C
Step3: if N <=100 then
write P=C,C=N go to step 2
Step4:Exit

8. THANK YOU
I hope you will be better understand about
Fibonacci series.
Presentation by Faraz Ahmed