Problem #WSP-000108

Problemas Álgebra Sucesiones Relaciones recurrentes Números de Fibonacci

Problem

Can every whole number be written as the sum of two Fibonacci numbers? If yes, then prove it. If not, then give an example of a number that can’t be. The two Fibonacci numbers don’t have to be different.