20021024, 21:51  #1 
1110010100100_{2} 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. 
20021025, 03:27  #2  
Aug 2002
110100_{2} Posts 
Re: Fibonacci sums?
Quote:
Quote:
There are more. 

20021025, 21:47  #3  
Aug 2002
Portland, OR USA
2×137 Posts 
Re: Fibonacci sums?
Quote:
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 < 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(n1) + F(n2), then repeat the process until you have p numbers. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Sums of all Squares  davar55  Puzzles  183  20191212 22:31 
Primes in nfibonacci sequence and nstep fibonacci sequence  sweety439  And now for something completely different  17  20170613 03:49 
Sequences and sums  Microraptor  Homework Help  10  20110225 08:12 
Integers = sums of 2s and 3s.  3.14159  Miscellaneous Math  12  20100721 11:47 
Fibonacci modulo Fibonacci  robert44444uk  Math  3  20070519 07:15 