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…
Don't be sorry! I found your comment very interesting and was also surprised to find that there exists a closed-form solution.
Was the purpose of this post to help people prepare for interviews? Does code always have to show off one's ability? This code inspired me to learn about Binet's formula and for that reason I think it was valuable.
returning int(round(x)) could act as a bandaid for the slight error in the results.
Just add more 9's to the divisor to make the pattern work for larger numbers: 1/99998 = 0.00001 00002 00004 00008 00016 00032 00064 00128 00256 00512..
It's really mind blowing how it's written entirely in javascript
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…
Don't be sorry! I found your comment very interesting and was also surprised to find that there exists a closed-form solution.
Was the purpose of this post to help people prepare for interviews? Does code always have to show off one's ability? This code inspired me to learn about Binet's formula and for that reason I think it was valuable.
returning int(round(x)) could act as a bandaid for the slight error in the results.
Just add more 9's to the divisor to make the pattern work for larger numbers: 1/99998 = 0.00001 00002 00004 00008 00016 00032 00064 00128 00256 00512..
It's really mind blowing how it's written entirely in javascript