GPY - Fibonacci Sequence

by Grawmpy Troll

Version 3 (April 26, 2018)

Download (31 downloads)

[Slimmed down]
The Fibonacci sequence is a pattern of numbers where each number is the sum of the two preceding numbers, starting with either 0 and 1, or 1 and 1. I have chosen to use 1 and 1: 1, 1, 2, 3, 5, 8, 13 . . .

This flow promps you to enter the number of times you want it to compute out the sequence. It does all the math, giving you the values in the output.
---------------------------------------------------------------
This flow starts with the first two numbers in the sequence, (a=1, b=1) then we start adding: c=a+b, a=b+c, b=c+a... and so on.

We get the value of the sums and count each time an addition is made, storing each of these values in their variable. We compare the current count to the number you entered and when the count finally equals your number, the final sum's value is added to the stored values and the result is given in the output.
---------------------------------------------------------------
Named after the Italian mathematician, Leonardo of Pisa, known as Fibonacci.

In mathematics, the Fibonacci numbers (1, 1, 2, 3, 5, 8, 13 . . .) are characterized by the fact that every number, after the first two (whether 0 and 1 or 1 and 1), is the sum of the two preceding ones, the average difference between these numbers is represented by the Greek "phi", Φ , given the value of the golden ratio: 1.1618 : 1

For more information on the Fibonacci numbers, see wikipedia https://en.wikipedia.org/wiki/Fibonacci_number

5.0 average rating from 2 reviews

5 stars
2
4 stars
0
3 stars
0
2 stars
0
1 star
0
Warnings
0

Reviews and ratings can be submitted in the app.