The Secret Cycles in the Fibonacci Sequence 

Thanks for watching! Check the description for more cool links and stuff :)

Nothing is more interesting than somebody who is has tons of energy to talk about mathematics in realms beyond what they teach in school.

4:40 I love hearing the huge clock in the background here!

This can be extended out beyond the actual Finonacci numbers to explore how any pair of start numbers lead to a pattern of the last digits. In base ten you actually get 6 different chains. The first is the 60 digit chain in the video, 011235831459437077415617853819099875279651673033695493257291. Then there is a 20 digit chain of all even numbers, 02246066280886404482. There's also a 12 digit chain, 134718976392, a 4 digit chain, 2684, and a 3 digit chain, 055. The final chain is the null chain, which could be represented by a single zero, but takes in a single addition of last digits (0+0) and therefore maybe should be represented as 00, but then the Fibonacci process means that we need the first two digits to add to the third so maybe it needs to be represent as 000, except that we wrap the last addition of digits around from the end to the start in all other examples so maybe 00 or even 0 is an ok representation.

Here's a suggestion for a future video: One over 24th Prime number equals the Fibonacci Sequence overlayed with itself with each concecutive digit being offset by one; as in continuously subtracting the next fibonacci number from 1/89 while moving over one digit ends up zeroing out the result to infinite digits.

Just when I thought I knew everything about Fibonacci….. brilliant as always. And you’ve just written my Friday lesson for my top set maths class. Thanks Domotro! 😃👍

Hated math in school. You make this stuff make sense. I love it. Keep it going!

There was an episode of MathNet that had tiles in a mosaic encoded with mod 5 (maybe 6?) Fibonacci numbers. It has caused me to play with this concept ever since. Glad to see I'm not the only one poking at it!

This class is much nicer than the one I had in school because of the cool enthusiastic teacher and the lack of homework. Although, I wouldn't mind solving something for a change.

Thank you, Combo Class. You make education fun, and you also make jokes from time to time, unlike some teachers who just go, "And then blah is equal to b+a+h-g³/√π÷5.4" . Keep doing rhe great work, and you will be one of the top Education Channels! Remember me when you get to the top.

thank you for making your shorts account otherwise I dont think id have ever found your full channel

I've previously thought about the mod 10 digit cycles, and discovered some pretty interesting things: As you mentioned, the last digits of Fibonacci numbers cycle with a period of 60. Let's start with the numbers 0 and 1, and write the last digits of every number in the cycle: 011235831459437 077415617853819 099875279651673 033695493257291 Notice the way I wrote it: four lines, each of which consist of 15 numbers. These four lines are kind of "sub-cycles" in a way, because they all show a similar pattern: they all start with a zero, and they feature a five in the sixth and eleventh positions. For the other numbers, it's almost like they've been put through a cipher for every sub-cycle, where every digit except 0 and 5 transforms into something else. 1 becomes 7, 2 becomes 4, 3 becomes 1, 4 becomes 8, 6 becomes 2, 7 becomes 9, 8 becomes 6, and 9 becomes 3. Generally, each digit becomes 7 multiplied by itself, modulo 10, which makes sense considering how the "sub-cycles" started: whenever there gets to be a 0 in the cycle, whatever number precedes it becomes almost a "seed" of sorts, starting a new cycle by appearing twice. However, this cycle does not tell the full story: let's look at every 2-digit number that appears in this cycle, allowing them to start with a 0. For instance, the first few would be 01, 11, 12, 23, etc. Note that numbers like 70 and 10 are included in this list: 70 just spans across two lines (which are just visual aids to emphasize the sub-cycles), and 10 spans from the end of one cycle to the beginning of the next. How many of these numbers are there? Well, every number in this cycle only depends on the two numbers before it, so if a two-digit number repeats, we have necessarily completed the cycle. Thus, because the cycle has length 60, there are exactly 60 two-digit numbers in the cycle. That means that there are 40 that we don't have! For instance, we will never see the digit string "22", corresponding to two consecutive Fibonacci numbers ending with a 2, and this should make sense: you showed in the video that the parities of the Fibonacci numbers repeat in an "even-odd-odd" pattern, making two consecutive even Fibonacci numbers impossible. But what if we start a chain at 22 and go from there? Or actually, let's start a chain at 02, to match our 01 chain from earlier. We'll get 22 as our next two-digit number anyway. When we do this, we get: 02246 06628 08864 04482 Here, we see a cycle of 20, made of four sub-cycles of length 5. Because we started with two even numbers, all of the numbers in this cycle are even, so I like to call this one "the even cycle". (I call the first one we discovered "the normal cycle"). We again see a sort of "cipher" pattern: to get from one "sub-cycle" to the next, turn all of the 2s into 6s, the 4s into 2s, the 6s into 8s, and the 8s into 4s. This "cipher" corresponds to a multiplication by 3. This cycle actually has the same structure as the cycle you get by taking the last digits of the Fibonacci numbers in base 5: you can think of it as multiplying each digit in the original chain by 2, and multiplying by 2 in mod 10 collapses numbers that are congruent modulo 5 into the name number. Instead of multiplying by 2, we can multiply the normal chain by other numbers, but multiplying by 3, 7, or 9 just results in a phase-shifted version of the normal chain, and multiplying by 4, 6, or 8 just results in a phase-shifted version of the even chain. The only other numbers mod 10 that provide unique chains are 5 and 0, but their chains are considerably more boring: the chain for 5 is 055 (I call it "the five chain".) and the chain for 0 is 0 (I call it "the zero chain".) Much like how the even chain corresponded to taking the Fibonacci numbers mod 5, the five chain corresponds to taking the Fibonacci numbers mod 2, and here it's easier to see: the Fibonacci numbers' parities cycle in an "even-odd-odd" cycle, where the "even" corresponds to the 0 in the five chain and the two "odd"s correspond to the two 5s. I guess, by analogy, the zero chain would correspond to the Fibonacci numbers modulo 1? Multiplying by 0 is the same as multiplying by 10, and every integer modulo 1 is 0, so it makes enough sense. However, all of these chains we've talked about so far have a combined length of 84, meaning there are still 16 two-digit numbers we can construct that haven't appeared in any chain so far! To find these chains, let's look back at the normal chain for a second. 01123 58314 59437 07741 56178 53819 09987 52796 51673 03369 54932 57291 I've added spaces every five numbers to better show some of the patterns. Let's have a look back at the 0s and 5s in this chain. We recognized earlier that every subchain started with a 0, and had a 5 as its sixth and eleventh digits, so looking at only every fifth digit (starting from the first), we get "055055055055..." This is the five chain again! So the five chain is sort of contained within the normal chain, because if you take every fifth digit from the normal chain, you get the five chain! This begs the question: What if we take every fifth digit starting from a different point in the chain? Let's try it out starting from the first 1: 189 763 921 347 Surprisingly, this sequence of numbers follows the rules of Fibonacci: every digit is the sum of the two previous ones in the cycle modulo 10. More than that, it's a completely new chain, this time of length 12. I like to call this one "the Lucas chain", because it shows up when dealing with Lucas numbers (a sequence like the Fibonacci numbers but the first two numbers are 2 and 1, and the normal Fibonacci rule applies from there, so the first few Lucas numbers are 2, 1, 3, 4, 7, 11, 18, ...). The "21" in the middle of the chain corresponds to the first two Lucas numbers. We obtained this chain through this "take every fifth number" process, which I like to call "compression". Let's see what else we can do with compression. If we compress the even chain, we get: 2684 I call this one "the even Lucas chain" because it's sort of a combination of the even chain and the Lucas chain. You can obtain it as I just did by taking the even chain and compressing it, or you can take the Lucas chain and multiply it by 2. It's a short chain, consisting of just four elements. And, with that, we have successfully found all of the chains in base 10. The combined lengths of these chains is 100, meaning that we have accounted for every two-digit combination, and every one of them will fall into either the normal chain, the even chain, the five chain, the zero chain, the Lucas chain, or the even Lucas chain. Any multiplications or compressions on any of these chains will just yield chains we've talked about previously: for instance, multiplying the Lucas chain by five just yields the normal five chain, and compressing the Lucas chain just yields a phase-shifted version of the Lucas chain. I haven't analyzed what would happen if you tried to do this procedure in other bases, but there would almost certainly be different structures, but they would probably be similar to the ones we saw in base 10. (Edit: The fives don't occur at the fifth and tenth positions, they occur at the sixth and eleventh positions.)

When Fib(n) / Fib(n-1) approaches Φ ... and the reappearance of the Fib() sequence in the tail later on _also_ approaches Φ (at least that far down) ... does this somehow mean that Φ is composed of overlapping versions of itself?

I like your passion keep it alive!

So the last digits of the Fibonacci sequence of numbers themselves follow a sequence of 60 before repeating, at least in base ten. I just looked at the so-called Jacobstahl sequence, OEIS A001045, which only has such a cycle of 4, namely 1 1 3 5 before repeating. How do the differences in the recursions account for this? They are An = An-1 + 2(An-2) for the Jacobsthal, while that of the Fibonacci is An = An-1 + (1)An-2.

The video proves that any starting numbers must eventually end in a cycle. It is also true though that those starting numbers must themselves be part of that cycle. (The reason being that the Fibonacci sequence is invertible, i.e. you can uniquely calculate it backwards too, as opposed to for instance the Collatz sequence.)

wow, very nice! I can't imagine how much time you put into this video. Thank you!

Love these videos. Subbed.

Well done sir. The Fibonacci numbers (golden ratio) and the harmonic series (music), are the fingerprints of God, perfectly designed.

wonderful class , many thanks!

wow! the pattern is so intereting. it is inspiring me so much. !'d better look at closely fibonacci numbers. thanks😁

you're awesome :D I enjoyed this.

I wonder what cool properties these Fibonacci-like sequences have addition (standard) -> n = (n-1) + (n-2) subtraction -> n = (n-1) - (n-2) complex -> n = (n-1) + (n-2)i Eisenstein -> n = (n-1) + (n-2)w

This is interesting because if because of the birthday paradox, if the fibonacci sequence was random, it would repeat after only 14.142 number... yet it goes up to 60. It's like the Fibonacci sequence was anti-random. It's even more amazing when you think that some sequences cannot happen. like 00.

Did you know that you were going to make a lot of videos that involve modular arithmetic when you chose your clocks anesthetic? Lol

Youre amazing love your videos

There are so many patterns in this, that I don’t even know where to start… I’m playing with a bunch of Python code checking out cycle lengths, starting numbers, etc

Very interesting, but sorely disappointed you didn’t explore the patterns of Fibonacci numbers in phinary

Most excellent video

i thought this would come down to the fibonacci sequence as a whole re-repeating in its last digtis at some point... (is there some known sequence of that type?)

Search for "Fibonacci in binary" and look for the patterns.

Just realized I got way too few whiteboards in my backyard

does the base correlate to the amount of numbers before the Fibonacci sequence resets?

Are there any bases that repeat every b^2?

Big D slangin' those digits

F(8) +1 👍

The digit sums of the Fibonacci numbers form a sequence that repeats every 24 Fibonacci numbers.

Grandfather Clock feature 4:38

Love math and love u brother 😊

I've only gotten up to base 24 so far, but I noticed that there are only certain bases where the last digit representation in said base has a periodic repeating cycle which begins and ends with zero *and has no other zeros in between*. So far the only bases 2-24 with this property are 2, 4, 11, and 22. Whyyyyyy? Aka what causes some bases to have single periods between last digit zeros and others to have multiple cycles with zeros in between before going back to 1, 1..

You are mixing base 12 and mod 12 which are different things ... but we get the point and the video is cool

Actually, the first occurrence of two terminating zeros occurs at F(150).

this room is giving me anxiety

It happens at any point where the previous two were 9 then 1.

I learned the Fibonacci sequence very early in my development; but it took a very long time before I discovered more than just the basic concept. It's always nice to find interesting Fibonacci patterns that are instructive for young people.

the fibonnocia sequence restarts at the 25 number

We as a species screwed up by abandoning base 12 in favor of base 10.

Hey Domotro, I'm a mathematician & I would like to share some of my research regarding different sizes of of infinity. I am not joking when I say I have discovered a 3rd size of infinity but my research goes far beyond that. At some point I am able to prove that the current definition of a real number is wrong and that imaginary numbers must be a subset to real numbers. I really want to share more with you about this but I have a feeling your the right person to discuss this with.

At this point in time and history I think we got to ask: what are YOUR opinions on the industrial revolution and its consequences for the human race? xD

Comment for the algorithm

First! f(0)

Zero is even?

not particularly surprising...?