Project Notes

This project was inspired by the thought of what would happen if I made scratch count in a neverending sequence. I know it's going to crash but when and why?

HOW THIS WORKS:

I have three variables: Sequence, LLN and LN.Please note my formulae is not the original formulae but my understanding of it.

Let me explain each one carefully.

SEQUENCE
This variable is simply what you see. The numbers are not generated by it, but is displayed by it.

LLN
It stands for Last Last Number. Here is a further explaination.
The first LLN is 0, then 1, then 2, then 3, then 5 and so on. It means the previous to previous unit in the sequence.

LN
It stands for Last Number. Here is a further explaination.
The first LN is 1, then 2, then 3, then 5 and so on. It means the previous unit in the sequence.

WHY DO I NEED THESE VARIABLES?
Well, the algabraeic formulae for this is
LLN + LN = NN
NN= New number
LLN=Last last number
LN=Last number

Think about it. Switch the letters for numbers you have:

0+1=1
1+1=2
1+2=3
2+3=5
5+3=8

And so on. Now what do we call that clever little sequence? The fibbonacci sequence!

That's how this Program works!
The number changes in 1/10 of a second. Or 0.1 seconds.

HISTORY ON FS
The fibbonacci sequence was created by Leonardo of Pisa, aka Fibbonacci. His book Liber Abaci, includes the fibbonacci sequence which he introduced to Western Mathematics although it was previously recorded in Indian Mathematics.

NOTE:
This works really really badly online, please download for the proper version.
Thank you!