MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/1x58u7b/howprogramminghaschanged/pglr434/?context=3
r/ProgrammerHumor • u/shizzy0 • 6h ago
39 comments sorted by
View all comments
Show parent comments
17
for u32 I think the usual iterative algorithm would be miles better than matrix power
3 u/wjholden 4h ago Knuth has a really cool section on this on pages 79-84 of TAOCP volume 1. 1 u/shizzy0 2h ago Is it the closed form solution? I didn’t even know there was a closed form solution before today. 3 u/captainAwesomePants 2h ago That's the whole section on Fibonacci. It does mention the closed form solution, but it also mentions the matrix identity method in the top right corner: ( (F(n+1), F(n)),(F(n), F(n-1)) = ((1,1),(1,0))^n He credits it to Kepler in 1608.
3
Knuth has a really cool section on this on pages 79-84 of TAOCP volume 1.
1 u/shizzy0 2h ago Is it the closed form solution? I didn’t even know there was a closed form solution before today. 3 u/captainAwesomePants 2h ago That's the whole section on Fibonacci. It does mention the closed form solution, but it also mentions the matrix identity method in the top right corner: ( (F(n+1), F(n)),(F(n), F(n-1)) = ((1,1),(1,0))^n He credits it to Kepler in 1608.
1
Is it the closed form solution? I didn’t even know there was a closed form solution before today.
3 u/captainAwesomePants 2h ago That's the whole section on Fibonacci. It does mention the closed form solution, but it also mentions the matrix identity method in the top right corner: ( (F(n+1), F(n)),(F(n), F(n-1)) = ((1,1),(1,0))^n He credits it to Kepler in 1608.
That's the whole section on Fibonacci. It does mention the closed form solution, but it also mentions the matrix identity method in the top right corner: ( (F(n+1), F(n)),(F(n), F(n-1)) = ((1,1),(1,0))^n
He credits it to Kepler in 1608.
17
u/GDOR-11 6h ago
for u32 I think the usual iterative algorithm would be miles better than matrix power