Recursion

Let \(f(1)=1, f(2)=2\) and \[ f(n) = f(n-2) + 2f(n-1)\] where \(n>2\) be a recursive function. Write a program to find the image value of any positive integral value n.

Can you find f(33) mod 2016 mod 100 ?


this problem is a part of the set Fundamental Programming
×

Problem Loading...

Note Loading...

Set Loading...