Doubt - SPP - Recursive Sequence (Version II)

#1

Problem: SPP - Recursive Sequence (Version II)

Problem link - https://online.codingblocks.com/app/player/158115/content/165260/5125/code-challenge


For nth fibonacci number, the recurrence relation is Fn = T^(n-1) * F1


But for SPP problem, how the power of transformation matrix - T is (n-k) and not (n-1)?
Please explain

#2

Hello @thirumeni.m07 your doubt is not in my section you may raise the doubt again so that you some other TA may answer you.
Happy Learning!!

1 Like
#3

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.