We will use the Principle of Strong Induction to show that every positive integer can be uniquely represented as a sum of distinct nonconsecutive Fibonacci numbers.
We will use the Principle of Strong Induction to show that every positiveinteger can be uniquely represented as a sum of distinct nonconsecutive Fibonaccinumbers.