09.12.2012 Views

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Well, y must be<br />

irrational, because<br />

of a little-known<br />

Einsteinian assertion:<br />

“God does<br />

not throw huge<br />

denominators at<br />

the universe.”<br />

6.7 CONTINUANTS 293<br />

There<strong>for</strong>e nobody believes that y is rational; but nobody so far has been able<br />

to prove that it isn’t.<br />

Let’s conclude this chapter by proving a remarkable identity that ties a lot<br />

of these ideas together. We introduced the notion of spectrum in Chapter 3;<br />

the spectrum of OL is the multiset of numbers Ln&], where 01 is a given constant.<br />

The infinite series<br />

can there<strong>for</strong>e be said to be the generating function <strong>for</strong> the spectrum of @,<br />

where @ = (1 + fi)/2 is the golden ratio. The identity we will prove, discovered<br />

in 1976 by J.L. Davison [61], is an infinite continued fraction that<br />

relates this generating function to the Fibonacci sequence:<br />

(6.143)<br />

Both sides of (6.143) are interesting; let’s look first at the numbers Ln@J.<br />

If the Fibonacci representation (6.113) of n is Fk, + . . . + Fk,, we expect n+<br />

to be approximately Fk, +I +. . . + Fk,+i , the number we get from shifting the<br />

Fibonacci representation left (as when converting from miles to kilometers).<br />

In fact, we know from (6.125) that<br />

n+ = Fk,+, + . . . + Fk,+l - ($“I + . + q”r) .<br />

Now+=-l/@andki >...>>k,>>O,sowehave<br />

and qkl +.. .+$jkl has the same sign as (-1) kr, by a similar argument. Hence<br />

In+] = Fk,+i +.‘.+Fk,+l - [k,(n) iseven]. (6.144)<br />

Let us say that a number n is Fibonacci odd (or F-odd <strong>for</strong> short) if its least<br />

significant Fibonacci bit is 1; this is the same as saying that k,(n) = 2.<br />

Otherwise n is Fibonacci even (F-even). For example, the smallest F-odd

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!