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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

(Here t and T<br />

aren’t necessarily<br />

related as in<br />

~w9~J<br />

5 EXERCISES 231<br />

8 Evaluate xk (L)(-l)k(l -k/n)“. What is the approximate value of this<br />

sum, when n is very large? Hint: This sum is An f (0) <strong>for</strong> some function f.<br />

9 Show that the generalized exponentials of (5.58) obey the law<br />

&t(z) = &(tz)<br />

1/t<br />

, if t # 0,<br />

where E(z) is an abbreviation <strong>for</strong> &I(Z).<br />

10 Show that -2(ln(l -2) + z)/ z2 is a hypergeometric function.<br />

11 Express the two functions<br />

23 25 2'<br />

sin2 = z--+--rlt<br />

3! 5! .<br />

arcsinz<br />

1.23<br />

= 2 + 23 + 1.3.25 2.4.5 + 1.3.5.27 2.4.6.7 +"'<br />

in terms of hypergeometric series.<br />

12 Which of the following functions of k is a “hypergeometric term,” in the<br />

sense of (5.115)? Explain why or why not.<br />

a nk.<br />

Basics<br />

b kn.<br />

c (k! + (k+ 1)!)/2.<br />

d Hk, that is, f + t +. . . + t.<br />

e t(k)T(n - k)/T(n), when t and T are hypergeometric terms.<br />

f (t(k) + T(k))/2, when t and T are hypergeometric terms.<br />

g (at(k) + bt(k+l) + ct(k+2))/(a + bt(1) + ct(2)), when t is a<br />

hypergeometric term.<br />

13 Find relations between the superfactorial function P, = nl, k! of exercise<br />

4.55, the hyperfactorial function Q,, = nL=, kk, and the product<br />

Rn = I-I;==, (;>.<br />

14 Prove identity (5.25) by negating the upper index in Vandermonde’s convolution<br />

(5.22). Then show that another negation yields (5.26).<br />

15 What is tk (L)"(-l)"? Hint: See (5.29).<br />

16 Evaluate the sum<br />

c (o:Uk) (b:bk) (c:k)(-li*<br />

when a, b, c are nonnegative integers.<br />

17 Find a simple relation between (2n;“2) and (2n;i’2).

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

Saved successfully!

Ooh no, something went wrong!