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.

514 ANSWERS TO EXERCISES<br />

because al - a2 = (a1 + k) -~ (al + k). If al - bl is a nonnegative integer d,<br />

this second identity allows us to express F(al , , . , a,,,; bl , . . . , b,; z) as a linear<br />

combination of F( a2 + j, a3, . . . , a,,,; b2, . , b,; z) <strong>for</strong> 0 6 j 6 d, thereby<br />

eliminating an upper parameter and a lower parameter. Thus, <strong>for</strong> example,<br />

we get closed <strong>for</strong>ms <strong>for</strong> F( a, b; a - 1; z), F( a, b; a - 2; z), etc.<br />

Gauss [116, $71 derived analogous relations between F(a, b; c;z) and<br />

any two “contiguous” hypergeometrics in which a parameter has been changed<br />

by fl . Rainville [242’] gene:ralized this to cases with more parameters.<br />

5.26 If the term ratio in the original hypergeometric series is tkfl /tk = r(k),<br />

the term ratio in the new one is tk+I/tk+l = r(k + 1). Hence<br />

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

F<br />

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

= 1 + "-'amzF b +,<br />

bl . ..b. (<br />

1)<br />

1 ,...! b,+l,2 ’ ’<br />

5.27 This is the sum of the even terms of F(2a1,. . . ,2a,; 2bl,. . . ,2b,; z).<br />

We have (2a)=/(2a)X = 4(k+ a)(k+ a + i), etc.<br />

5.28 WehaveF(“;b]z)= (I-z)~"F(~~~~"~~)= (l-zzpuF(' ,"sals)=<br />

(, mz)c a bF(C-yb 1~). (Euler proved the identity by showing that both<br />

sides satisfy the same differential equation. The reflection law is often attributed<br />

to Euler, but it does not seem to appear in his published papers.)<br />

5.29 The coefficients of 2” are equal, by Vandermonde’s convolution. (Kummer’s<br />

original proof was different: He considered lim,,, F(m, b - a; b; z/m)<br />

in the reflection law (5.101).)<br />

5.30 Differentiate again to get z(1 - z)F"(z) + (2 - 3z)F'(z) - F(z) = 0.<br />

There<strong>for</strong>e F(z) = F(l,l;2;z) 'by (5.108).<br />

5.31 The condition f(k) = cT(k+ 1) - CT(k) implies that f(k+ 1)/f(k) =<br />

(T(k+2)/T(k+ 1) - l)/(l --T(k)/T(k+ 1)) is a rational function of k.<br />

5.32 When summing a polynomial in k, Gosper’s method reduces to the<br />

“method of undetermined coefficients!’ We have q(k) = r(k) = 1, and we<br />

try to solve p(k) = s(k+ 1) - s(k). The method suggests letting s(k) be a<br />

polynomial whose degree is cl = deg(p) + 1.<br />

5.33 The solution to k = (k- l)s(k+ 1) - (k+ l)s(k) is s(k) = -k+ 5;<br />

hence the answer is (1 - 2k)/‘2k(k - 1) + C.<br />

5.34 The limiting relation holds because all terms <strong>for</strong> k > c vanish, and<br />

E - c cancels with -c in the limit of the other terms. There<strong>for</strong>e the second<br />

partial sum is lim,,o F(-m,--n; e-mm;l) = lim,,~(e+n-m)m/(e-m)m =<br />

(-l)yy).<br />

5.35 (a) 2m"3n[n>0]. (b) 11 - i)PkP’[k>,O] =2k+‘[k>0].

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

Saved successfully!

Ooh no, something went wrong!