recurrence relation dependent inversly on n
I recently learnt to find out nth number fibonacci series by matrix
exponentiation. but i am stuck on two relations :
1) F(n)=F(n−1)+n
2)F(n)=F(n−1)+1/n
Is there any efficient way to solve these in O(logn) time like we have
matrix expo. for fibonacci series ?
No comments:
Post a Comment