What is the smallest positive integer that cannot be expressed as the sum of 2 Fibonacci numbers (not necessarily distinct)?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
F n = 0 , 1 , 1 , 2 , 3 , 5 , 8 , . . . .
2 + 2 = 4
3 + 3 = 6
2 + 5 = 7
8 + 1 = 9
5+5=10
8 + 3 = 1 1
1 2 → c a n ′ t b e e x p r e s s e d a s s u m o f t w o f i b o n a c c i n u m b e r .
Hence the answer is 1 2 .