function inv = invfib(f,n) % f is a two-digit vector containig two fibonacci numbers f_k and f_(k+1). % n is the number of times the fibonacci recursion has to be inversed. for k=1:n f = [f(2)-f(1), f(1)]; end inv=f;