Sei sulla pagina 1di 3

ECS 315: Probability and Random Processes

2011/1

HW 1 Due: July 6
Lecturer: Prapun Suksompong, Ph.D.

Instructions (a) ONE part of a question will be graded (5 pt). Of course, you do not know which part will be selected; so you should work on all of them. (b) It is important that you try to solve all problems. (5 pt) (c) Late submission will be heavily penalized. (d) Write down all the steps that you have done to obtain your answers. You may not get full credit even when your answer is correct without showing how you get your answer. Problem 1. (Set Theory) Let = {0, 1, 2, 3, 4, 5, 6, 7}, and put A = {1, 2, 3, 4}, B = {3, 4, 5, 6}, and C = {5, 6}. Evaluate A B, A B, A C, Ac , and B \ A. For this problem, only answers are needed; you dont have to describe your solution.

Problem 2. (Set Theory) In general, A(B C) = (A B)C. It is possible to construct the sets A, B and C such that A (B C) = (A B) C. (1.1)

For example, if all of them are , then (1.1) is satises. If all of them are the same, that is A = B = C, then (1.1) is also satises. Construct an example satisfying (1.1) such that the sets A, B and C are all distinct and none of them are empty.

Problem 3. (Classical Probability) We all know that the chance of a head (H) or tail (T) coming down after a fair coin is tossed are fty-fty. If a fair coin is tossed ten times, then intuition says that ve heads are likely to turn up. Calculate the probability of getting exactly ve heads (and hence exactly ve tails).

1-1

ECS 315

HW 1 Due: July 6

2011/1

Problem 4. (Classical Probability) Shue a deck of cards and cut it into three piles. What is the probability that (at least) a court card will turn up on top of one of the piles. Hint: There are 12 court cards (four jacks, four queens and four kings) in the deck.

Problem 5. (Classical Probability) There are three buttons which are painted red on one side and white on the other. If we tosses the buttons into the air, calculate the probability that all three come up the same color.

Problem 6. Let pn be the probability of getting exactly n heads (and hence exactly n tails) when a fair coin is tossed 2n times. (a) Find pn . (b) Approximate pn using Stirlings Formula: n! (c) Find lim pn .
n

n 1 2nnn en = 2e e(n+ 2 ) ln( e ) .

(1.2)

Problem 7. (Classical Probability) Suppose n integers are chosen with replacement (that is, the same integer could be chosen repeatedly) at random from {1, 2, 3, . . . , N }. Calculate the probability that the chosen numbers arise according to some non-decreasing sequence. Problem 8. Binomial theorem: For any positive integer n, we know that
n

(x + y) =
r=0

n r nr xy . r

(1.3)

(a) What is the coecient of x12 y 13 in the expansion of (x + y)25 ? (b) What is the coecient of x12 y 13 in the expansion of (2x 3y)25 ?
n

(c) Use the binomial theorem (1.3) to evaluate

(1)k

k=0

n k

(d) Use the binomial theorem (1.3) to simplify the following sums
n

(i)
r=0 r even

n r

xr (1 x)nr

1-2

ECS 315
n n r

HW 1 Due: July 6 xr (1 x)nr

2011/1

(ii)
r=0 r odd

(e) If we dierentiate (1.3) with respect to x and then multiply by x, we have


n

r
r=0

n r nr xy = nx(x + y)n1 . r
n r=0

Use similar technique to simplify the sum

r2

n r

xr y nr .

1-3

Potrebbero piacerti anche