Occurrences in Mathematics
The Fibonacci numbers occur in the sums of "shallow" diagonals in Pascal's triangle (see Binomial coefficient).
The Fibonacci numbers can be found in different ways in the sequence of binary strings.
- The number of binary strings of length n without consecutive 1s is the Fibonacci number Fn+2. For example, out of the 16 binary strings of length 4, there are F6 = 8 without consecutive 1s – they are 0000, 0100, 0010, 0001, 0101, 1000, 1010 and 1001. By symmetry, the number of strings of length n without consecutive 0s is also Fn+2.
- The number of binary strings of length n without an odd number of consecutive 1s is the Fibonacci number Fn+1. For example, out of the 16 binary strings of length 4, there are F5 = 5 without an odd number of consecutive 1s – they are 0000, 0011, 0110, 1100, 1111.
- The number of binary strings of length n without an even number of consecutive 0s or 1s is 2Fn. For example, out of the 16 binary strings of length 4, there are 2F4 = 6 without an even number of consecutive 0s or 1s – they are 0001, 1000, 1110, 0111, 0101, 1010.
Read more about this topic: Fibonacci Numbers
Famous quotes containing the word occurrences:
“If to be venerated for benevolence, if to be admired for talents, if to be esteemed for patriotism, if to be beloved for philanthropy, can gratify the human mind, you must have the pleasing consolation to know that you have not lived in vain. And I flatter myself that it will not be ranked among the least grateful occurrences of your life to be assured that, so long as I retain my memory, you will be thought on with respect, veneration, and affection by your sincere friend.”
—George Washington (1732–1799)