Background: Fibonacci numbers are a series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. A simple example is: 1, 1, 2, 3, 5, 8, etc.
I am trying to understand how can I detect whether a vector contains Fibonacci numbers or not. Is it possible to accomplish this through a vectorized operation (I mean without using a loop)?