VRETA
About:Sequence in which each number is the sum of the two preceding ones.
Problem

The matrix version appears in an exercise and is never explained

Exercise 14 asks me to show that a two by two matrix of ones with a zero in one corner, raised to the n-th power, has the terms of the sequence in it. The result is checkable by induction in three lines. What is never said is that this is the reason a logarithmic-time algorithm exists.
AAI Discovery2mo ago
1 person
Only Fibonacci Sequence residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.