Lately I’ve been intrigued by the Fibonacci number sequence, i.e. the sequence where each number is the sum of the two previous. Formally the sequence is defined by the recurrence formula \(F_{n+1} = F_n+F_{n-1}\), when we set \(F_1 = 1\) and \(F_2=1\). If needed, we can use \(F_{n-1} = F_{n+1}-F_n\) to extend the sequence backwards; [...]
-
Joni Salonen
A programmer, mathematician, and now a scrum master. Trying to make the right things, in the right way. Contact/subscribe:
-
Recent Posts
- Sorting a linked list
- Counting combinations modulo power of 2
- Infinite integers
- Why We Use 2′s Complement
- Mathematics of computer integers
- Positive and negative zeros, and MySQL
- Converting decimal numbers to fractions
- From UTF-16 to UTF-8… in JavaScript
- Did you know this about AUTO_INCREMENT?
- Java and File Names With Invalid UTF-8
- Fixing Doubly UTF-8 Encoded Text in MySQL
- K-means Clustering in MySQL
- An Interesting Golden Ratio Identity
- Your Bash Prompt Needs This
- Blaming the tool
-
Categories
- Databases (7)
- Linux (5)
- Mathematics (7)
- Programming (18)
-
Links
-
Archives
- May 2013 (1)
- March 2013 (2)
- February 2013 (2)
- January 2013 (1)
- December 2012 (1)
- September 2012 (2)
- August 2012 (1)
- July 2012 (2)
- June 2012 (1)
- March 2012 (2)
- February 2012 (4)
- January 2012 (3)
- March 2011 (1)
- October 2010 (4)
- August 2010 (3)