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.

208 BINOMIAL COEFFICIENTS<br />

into this <strong>for</strong>m. The a’s are the negatives of the roots of the polynomial in<br />

the numerator, and the b’s are the negatives of the roots of the polynomial<br />

in the denominator. If the denominator doesn’t already contain the special<br />

factor (k + 1 ), we can include (k + 1) in both numerator and denominator. A<br />

constant factor remains, and we can call it z. There<strong>for</strong>e hypergeometric series<br />

are precisely those series whose first term is 1 and whose term ratio tk+l/tk<br />

is a rational function of k.<br />

Suppose, <strong>for</strong> example, that we’re given an infinite series with term ratio<br />

tk+ 1<br />

- =<br />

k2+7k+10<br />

tk 4k2 + 1 ’<br />

a rational function of k. The numerator polynomial splits nicely into two<br />

factors, (k + 2) (k + 5), and the denominator is 4(k + i/2) (k - i/2). Since the<br />

denominator is missing the required factor (kf l), we write the term ratio as<br />

tk+ 1 (k+2)(k+5)(k+ 1)(1/4)<br />

- =<br />

fk (k+i/2)(k-i/2)(k+ 1) ’<br />

and we can read off the results: The given series is<br />

ix tk = toF(i;,?;2/V4).<br />

k>O<br />

Thus, we have a general method <strong>for</strong> finding the hypergeometric representation<br />

of a given quantity S, when such a representation is possible: First we<br />

write S as an infinite series whose first term is nonzero. We choose a notation<br />

so that the series is t k20 tk with to # 0. Then we Cahhte tk+l/tk. If the (NOW is a good<br />

term ratio is not a rational function of k, we’re out of luck. Otherwise we time to do warmuP<br />

exercise 11.)<br />

express it in the <strong>for</strong>m (5.81); this gives parameters al, . . . , a,, br, . . . , b,,<br />

and an argument z, such that S = to F( al,. . . , a,,,; br , . . . , b,; z).<br />

Gauss’s hypergeometric series can be written in the recursively factored<br />

<strong>for</strong>m<br />

a+2 b+2<br />

--z(1 +...)<br />

3 c-t2 )><br />

if we wish to emphasize the importance of term ratios.<br />

Let’s try now to re<strong>for</strong>mulate the binomial coefficient identities derived<br />

earlier in this chapter, expressing them as hypergeometrics. For example,<br />

let’s figure out what the parallel summation law,<br />

&(‘i”> = (r,,+‘), integern,

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

Saved successfully!

Ooh no, something went wrong!