November 22, 2007

1. p. 87. The last sentence of the first full paragraph on the page should read "Pascal, however, used it in the mid-seventeenth century to obtain combinatorial solutions."
    
2. p. 141. The last line on the page, to the left of the final equals sign, has an extra (-1)^k. Remove it.
    
3. p. 216. (missing closing parentheses) The 8th line of the algorithm should read:  t = -ln (1.0 - rand()) / lambda. In the same context, the 16th line should read: t = arrive - ln (1.0 - rand()) / lambda.
    
4. p. 232. In the center of the page, in the last equation before Theorem 3.20, the summations at the far right should be reversed. That is, the
   outer sum should run i from 1 to n, while the inner sum should run k from 1 to n.
    
5. p. 250. The statement of Theorem 3.36 should start: "Let i be a recurrent state in a Markov chain."
    
6. p. 371. The chapter title should read "Real-line Probability." The running heads in the chapter, as well as the table of contents, should reflect this change.