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.

232 BINOMIAL COEFFICIENTS<br />

18 Find an alternative <strong>for</strong>m analogous to (5.35) <strong>for</strong> the product<br />

(;) (r-y) (r-y).<br />

19 Show that the generalized binomials of (5.58) obey the law<br />

2&(z) = tBp,(-z)-‘.<br />

20 Define a “generalized bloopergeometric series” by the <strong>for</strong>mula<br />

G<br />

al, . . . , am a!. . , at zk<br />

z =<br />

bl, . . . . b, 1) k>O = b+...b$ k!’<br />

using falling powers inst,ead of the rising ones in (5.76). Explain how G is<br />

related to F.<br />

21 Show that Euler’s definition of factorials is consistent with the ordinary<br />

definition, by showing that the limit in (5.83) is 1/ ((m - 1) . . . (1)) when<br />

2 = m is a positive integer.<br />

22 Use (5.83) to prove the factorial duplication <strong>for</strong>mula:<br />

x! (x - i)! = (2x)! (-;)!/22”.<br />

23 What is the value of F(-n, 1; ; 1 )?<br />

24 Find tk (,,,tk) (“$“)4” by using hypergeometric series.<br />

25 Show that<br />

(a1 - bl) F<br />

= alF<br />

al, a2, . . . . a,<br />

bl+1, bz, . . . . b,<br />

al+l, al, . . . . a,<br />

bl+l, b2, . . . . b,<br />

14 --b,F(“d~:~~::;~:“bniL).<br />

Find a similar relation between the hypergeometrics F( al, al, a3 . . . , a,;<br />

bl,... ,bn;z), F(al + ‘l,az,as . . . . a,;bl,..., b,;z), and F(al,az + 1,<br />

as.. . , a,; bl,. . . , b,;z).<br />

26 Express the function G(z) in the <strong>for</strong>mula<br />

F<br />

al, . . . . a,<br />

z = 1 + G(z)<br />

bl, . . . . b, 1)<br />

as a multiple of a hypergeometric series.<br />

By the way,<br />

(-i)! = fi.

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

Saved successfully!

Ooh no, something went wrong!