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.

576 ANSWERS TO EXERCISES<br />

9.58 Let 0 < 8 6 1 and f(z) = e2xiro/( eZnir - 1). We have<br />

when xmod 1 = 4;<br />

when lyl 3 c.<br />

There<strong>for</strong>e /f(z)1 is bounded on the contour, and the integral is O(Mlmm).<br />

The residue of 2nif(z)/zm at z = k # 0 is eznike/km; the residue at z = 0 is<br />

the coefficient of 2-l in<br />

e2niz0 2rriz<br />

Zm+l (Bo + B1 T $- . . ><br />

27riz<br />

= &,(Wi +W+ +-.) ,<br />

namely (2ti)“‘B,(O)/m!. There<strong>for</strong>e the sum of residues inside the contour is<br />

(27ri)m enim/2 COS (2nk6 -- nm/2)<br />

m,B,(B) + 2F<br />

kz=l<br />

km<br />

This equals the contour integral O(Mlpm), so it approaches zero as M -+ 00.<br />

9.59 If F(x) is sufficiently well behaved, we have the general identity<br />

x F(k + t) = t G(2rm.)eZRint ,<br />

k n<br />

where G(y) = ST,” eciyXF(x) dx. (This is “Poisson’s summation <strong>for</strong>mula:<br />

which can be found in standard texts such as Henrici (151, Theorem 10.6e].)<br />

9.60 The stated <strong>for</strong>mula is equivalent to<br />

5 21<br />

___-<br />

+ 1024n3 32768n4<br />

+ O(C5)<br />

by exercise 5.22. Hence the result follows from exercises 6.64 and 9.44.<br />

9.61 The idea is to make cr “almost” rational. Let ok = 22zk be the kth<br />

partial quotient of 01, and let n = ;a,,,+, qm, where qm = K(al,. . . , a,) and<br />

m is even. Then 0 < {q,,,K} < l/Q(al,...,a,+.,) < 1/(2n), and if we take<br />

v = a,,,+1 /(4n) we get a discrepancy 3 :a,+, . If this were less than n’-’ we<br />

would have<br />

E<br />

%+1 = WlAy),<br />

but in fact a,+1 > 42,"

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

Saved successfully!

Ooh no, something went wrong!