Unusual Fibonacci problem. Is there a efficient way to solve it?

Question

Here is the problem:

• Define a function that, given an integer X, that returns an integer that corresponds to the minimum number of