Too small. Suppose we have a natural number that is not a Fibonacci number-let’s call it N. Let’s write F for the largest Fibonacci number that does not exceed N. Show that it is impossible to have a sum of two distinct Fibonacci numbers each less than F add up to N.
![Check Mark](/static/check-mark.png)
Want to see the full answer?
Check out a sample textbook solution![Blurred answer](/static/blurred-answer.jpg)
Chapter 2 Solutions
The Heart of Mathematics: An Invitation to Effective Thinking, WileyPLUS NextGen Card with Loose-leaf Set Single Semester: An Invitation to Effective Thinking (Key Curriculum Press)
Additional Math Textbook Solutions
Probability and Statistics for Engineers and Scientists
Introductory Combinatorics
Thinking Mathematically (7th Edition)
A Problem Solving Approach to Mathematics for Elementary School Teachers (12th Edition)
Mathematical Methods in the Physical Sciences
Mathematics with Applications In the Management, Natural and Social Sciences (11th Edition)
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageAlgebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
![Text book image](https://www.bartleby.com/isbn_cover_images/9780395977224/9780395977224_smallCoverImage.gif)