This program calculates the nth Fibonacci number in O(log(n)). It's possible to calculate F(1_000_000) in less than a second.
This repository contains the Python code for the paper "A Hierarchy of Fibonacci Forbidden-Word Hamiltonians: From the Golden Chain to the Plastic Chain and Aperiodic Order." === H_K Verification ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results