Something I found about the Fibonacci sequence

Mcbattle · 2014-01-29 14:48:21

So after I failed math last semester I got kicked into general math. But I already knew the concepts (I got a 94 after paying attention for less than 15 minutes over the course of 4 weeks) so I did what any other board 14 year does... screw around. I knew that if you take the remainder after dividing the Fibonacci numbers you see a pattern. However I noticed a pattern in the length of the patterns, but only when it was divided by certain numbers. The numbers in question would be 2^n for example:
2^1=2 The sequence is 3 numbers: 0,1,1
2^2=4 The sequence is 6 numbers: 0,1,1,2,3,1
2^3=8 The sequence is 12 numbers: 0,1,1,2,3,5,0,5,5,2,7,1
The pattern I noticed is that the length of the sequence is equal to

I have confirmed the same thing with 16 and 32 while in math by writing a program on my calculator. I was unable to go higher due to technical reasons though. I plan on looking into this later and seeing if it does continue.

Bob · 2014-01-29 20:03:20

hi Mcbattle

Welcome to the forum.

Sorry, I'm not following you. Would you fill in more details for an old brain.

Bob

Nehushtan · 2014-01-29 20:47:09

Let

Then

Is that it?

Mcbattle · 2014-01-30 08:54:51

Yes that is it. Or to make it easier it is the sum of the last two numbers in the sequence.

Nehushtan · 2014-02-04 03:09:19

I posted your query on another forum: http://www.artofproblemsolving.com/Foru … 8&t=573625.

As of now the thread has had 46 views but no reply.

Nehushtan · 2014-02-21 05:18:57

Ive been given this link (PDF):

http://math.arizona.edu/~ura-reports/07 … /Final.pdf

iamaditya · 2016-11-27 20:29:43

In Fibbonacci sequence the next term is found by adding the previous 2 terms. But if we add all the previous terms before it to get the next no. we will get

1,1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192..........
which is nothing but powers of 2.So,it is actually
2^0,2^0,2^1,2^2,2^3,2^4,2^5,2^6.........

Last edited by iamaditya (2016-11-30 23:05:06)

zahlenspieler · 2018-05-08 06:56:27

Mcbattle wrote:

Yes that is it. Or to make it easier it is the sum of the last two numbers in the sequence.

Hi Mcbattle, I've just finished an inductive proof of your claim: Let

, and if . Then
, and

for all integers .

(the 2nd statement is needed to complete the induction step.)
Furthermore, you need

.
I guess the easiest way is to use the Euler-Binnet formula; with a little more work, it can be proved without it.

Regards,
zahlenspieler

Math Is Fun Forum

#1 2014-01-29 14:48:21

Something I found about the Fibonacci sequence

#2 2014-01-29 20:03:20

Re: Something I found about the Fibonacci sequence

#3 2014-01-29 20:47:09

Re: Something I found about the Fibonacci sequence

#4 2014-01-30 08:54:51

Re: Something I found about the Fibonacci sequence

#5 2014-02-04 03:09:19

Re: Something I found about the Fibonacci sequence

#6 2014-02-21 05:18:57

Re: Something I found about the Fibonacci sequence

#7 2016-11-27 20:29:43

Re: Something I found about the Fibonacci sequence

#8 2018-05-08 06:56:27

Re: Something I found about the Fibonacci sequence

Board footer