GitHub - wonszrzeczny/project-euler-258-lagged-fibonacci-sequence-70: Problem had difficulty of 70%, solved using logarithmic matrix exponentiation, before I knew about Cayley-Hamilton theorem. Run time: long, since the matrices become dense around millionth power, could be done much faster by calculating x^(10^18) modulo the characteristic equation.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
.idea		.idea
258.py		258.py

About

Problem had difficulty of 70%, solved using logarithmic matrix exponentiation, before I knew about Cayley-Hamilton theorem. Run time: long, since the matrices become dense around millionth power, could be done much faster by calculating x^(10^18) modulo the characteristic equation.

linear-algebra fibonacci-sequence projecteuler-python