 mersenneforum.org > Math Fibonacci sums?
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read 2002-10-24, 21:51 #1 TTn   22×2,399 Posts Fibonacci sums? Is 2^p -1 always the sum of p Fibonacci numbers? examples: 3=1+2 7=1+1+5 31=2+3+5+8+13 127=1+1+2+13+21+34+55 2047= ...............................? 8191=1+1+5+21+34+55+89+233+377+610+987+1597+4181 I cant seem to find the sum for p=11.   2002-10-25, 03:27   #2
binarydigits

Aug 2002

1101002 Posts Re: Fibonacci sums?

Quote:
 Originally Posted by TTn Is 2^p -1 always the sum of p Fibonacci numbers?
Yes.

Quote:
 Originally Posted by TTn I cant seem to find the sum for p=11.
One answer is 2047=2+3+5+8+21+34+55+89+233+610+987.
There are more.   2002-10-25, 21:47   #3
Maybeso

Aug 2002
Portland, OR USA

2×137 Posts Re: Fibonacci sums?

Quote:
 Originally Posted by TTn Is 2^p -1 always the sum of p Fibonacci numbers?
Okay, lets make it more interesting:

Is 2^p - 1 always the sum of p Unique* Fibonacci numbers?
*(unique as in use each number once)

The smaller p will be difficult:
7 = 1+1+5 = 2+2+3 ... I see no solution for 3.

To prove or disprove either of these questions, it is sufficient to find the fewest q &lt; p Fibonacci numbers needed to sum each Mp.
i.e. if you can always express Mp as the sum of 5 Fn, then you can replace F(n) with F(n-1) + F(n-2), then repeat the process until you have p numbers.  Thread Tools Show Printable Version Email this Page Similar Threads Thread Thread Starter Forum Replies Last Post davar55 Puzzles 183 2019-12-12 22:31 sweety439 And now for something completely different 17 2017-06-13 03:49 Microraptor Homework Help 10 2011-02-25 08:12 3.14159 Miscellaneous Math 12 2010-07-21 11:47 robert44444uk Math 3 2007-05-19 07:15

All times are UTC. The time now is 14:42.

Sat Apr 17 14:42:59 UTC 2021 up 9 days, 9:23, 0 users, load averages: 1.39, 1.47, 1.52

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.