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.

298 SPECIAL NUMBERS<br />

24 Prove that the tangent number Tz,+l is a multiple of 2”. Hint: Prove<br />

that all coefficients of Tz,,(x) and Tzn+l (x) are multiples of 2”.<br />

25 Equation (6.57) proves that the worm will eventually reach the end of<br />

the rubber band at some time N. There<strong>for</strong>e there must come a first<br />

time n when he’s closer to the end after n minutes than he was after<br />

n - 1 minutes. Show that n < :N.<br />

26 Use summation by parts to evaluate S, = xr=, Hk/k. Hint: Consider<br />

also the related sum Et=, Hk-r/k.<br />

2’7 Prove the gcd law (6.111) <strong>for</strong> Fibonacci numbers.<br />

28 The Lucas number L, is defined to be Fn+r + F,--r. Thus, according to<br />

(6.log), we have Fzn = F,L,. Here is a table of the first few values:<br />

nl 0 1 2 3 4 5 6 7 8 9 10 11 12 13<br />

L,,I 2 1 3 4 7 11 18 29 47 76 123 199 322 521<br />

a Use the repertoire method to show that the solution Qn to the general<br />

recurrence<br />

Qo = a; Ql = B; Qn = Qn-l+Qn-2, n>l<br />

can be expressed in terms of F, and L,.<br />

b Find a closed <strong>for</strong>m <strong>for</strong> L, in terms of 4 and $.<br />

29 Prove Euler’s identity <strong>for</strong> continuants, equation (6.134).<br />

30 Generalize (6.136) to find an expression <strong>for</strong> the incremented continuant<br />

K(x,, . . . ,~,,~l,~~+y,~~+l,..., x,,), when 16 m

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

Saved successfully!

Ooh no, something went wrong!