Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
obfuskater
on Dec 17, 2014
|
parent
|
context
|
favorite
| on:
The Nth Fibonacci Number in O(log N)
Don't be sorry! I found your comment very interesting and was also surprised to find that there exists a closed-form solution.
sillysaurus3
on Dec 17, 2014
[–]
The whole book is pretty fascinating, "Mathematics for Computer Science" by Lehman and Leighton:
http://www.cs.princeton.edu/courses/archive/spring10/cos433/...
The formula came from section 17.3.2, which goes into detail about how to derive it.
obfuskater
on Dec 17, 2014
|
parent
[–]
Thanks. I like the way they introduce what a proof is in chapter 1, I feel like they have a good, subtle sense of humor. I don't have a mathematical background so it might be a tough read for me, but it seems like a great resource.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
