This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Problem 5: Suppose that a six sided die is thrown n times; assume that n is large. The faces of the die are numbered 1 through 6, and each is equally likely. Find a good upper bound on the probability that the average of the numbers computed over the n throws is less than 2.5. Hint: use Chebyshev’s inequality. Problem 6-7 (Optional): Solve the questions 3.9, and 3.10 from Chapter 3 of the text-book (the second edition). 1...
View Full Document
This note was uploaded on 10/10/2010 for the course ECE 6605 taught by Professor Staff during the Fall '08 term at Georgia Institute of Technology.
- Fall '08