Fibonacci computed using Lucas's identities

This is a(n):

• New algorithm
• Update to an existing algorithm
• Error
• Proposal to the Repository

Details: Missing an example of Fibonacci number computation uses Lucas's identity. It computes the n-th Fibonacci number in O(log(n)). The implementation is much shorter and easier than well-known matrix based approach.