Submitted by porichoygupto t3_10k5197 in Jokes
It’s as easy as 1, 1, 2, 3.
Submitted by porichoygupto t3_10k5197 in Jokes
It’s as easy as 1, 1, 2, 3.
The Fibonacci sequence is a series of numbers in which each number is the sum of the two that precede it. Starting at 0 and 1, the sequence looks like this: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on forever. The Fibonacci sequence can be described using a mathematical equation: Xn+2= Xn+1 + Xn.
I thought Fibbinacho was the act of pretending you don't have any nachos?
I learned something today. Thank you.
Fibonacci
Sequences
Are hard;
But even so
Just follow one simple rule
And you will understand it all soon enough
Or get this far, decide not to bother, and give up for good.
You stole Tool's bit.
Damn I didn't know what that was when I took an IQ test and figured it out without knowing about it??
The Fibonacci sequence also has something to do with the Golden Ratio. That’s pretty cool to. Most things in nature are created using this.
Random facts about Fibonacci’s sequence: Author is Leonardo Bonacci also known as Fibonacci. (He is son of Gustav Bonacci an Italian merchant. That “Fi” before Bonacci means he is son of someone) Fibonacci played with rabbit reproduction and created this sequence. If you express Fibonacci’s sequence in vector space with two last numbers as bases, it will converge to the golden ratio. (Look it up at the exact math explanation) We have equation for the n-th Fibonacci number which is based on the golden ratio.
Almost as good as your previous two jokes combined
Are we just gonna gloss over how we get from 0 to 1?
They're the base cases of the recursion and are therefore 0 and 1 by definition. You need two base cases because the recursive function uses the previous two numbers in the series to calculate the current one.
Edit: Sorry calling them base cases is inaccurate since that's another thing entirely in recursion. The reason they're defined stands though, the recurrence requires two initial values to work.
You're my hero
[removed]
That's fibnonachos...
So Fibonacci was a furry? Or maybe he played with rabbit reproduction in a less naughty way...
I only know about the sequence thru the episode of Criminal Minds with guest star Jason Alexander. Thanks goes to you Dr. Spencer Reid!
>Are we just gonna gloss over how we get from 0 to 1?
In the beginning there was nothing...
Great explanation. I'm no mathematician but I recently stumbled down a wondrous rabbit hole and this is probably the best place to share it.
"A Handbook of Integer Sequences" Fifty Years Later
And, The Online Encyclopedia of Integer Sequences itself.
Youre welcome !
I will give it a look thank you
Oh fuck you. Well done.
Black then white are all I see in my infancy Red and yellow then came to be, reaching out to me Lets me see.
Hahahahaha
RibaldPancake t1_j5oftwi wrote
Of course, this could also be a sequence starting with 1 and adding 0, 1, 2, 3 … so maybe not so easy.
Bonus: If you have only one element of a Fibonacci sequence in Mexico it’s a Fibbinacho.