Let be a sequence of s and s such that and is the number of between the and in the sequence. So the sequence starts out like this:
Prove (if you wish) that there exists a real number such that if and only if for some .
If can be written in simplest form as where are coprime natural numbers, find .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This sequence is a typical rabbit sequence, or equivalently a Fibonacci word. One way to construct this sequence is to draw a line y = k x on the square grid where k is irrational and mark a 0 where the line crosses a horizontal and a 1 at a vertical. This method is known as a cutting sequence. For this sequence, k = ϕ = 2 1 + 5 .
Given that the nth 1 must be on the line x = n − 1 , we count the number of "cuts" the line makes with the square grid.
( n + 1 ) + ⌊ n ϕ ⌋ = 1 + ⌊ n ( ϕ + 1 ) ⌋ = 1 + ⌊ 2 3 + 5 n ⌋