how can we solve F(n)=F(n-1)+F(n-2)+F(n-1)*F(n-2) using matrix expoentiation ,as N is of the order 10^9,and we are given n we need to calculate F(n)
A doubt related to topic
Please read the following links. We are using binary exponentiation to calculate the nth power of matrix, so we are able to do it in log(N) time.
Read binary exponentiation from here
and the read matrix exponentiation https://www.hackerearth.com/practice/notes/matrix-exponentiation-1/
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.