Exercise Lover

March 28, 2007

Problems C-1

Filed under: Problem C — yuhanlyu @ 3:48 pm

a. Every ball has n choices. Hence b^n.

b. By the hint, arrange n balls and b-1 sticks in a row. The begin to the first stick is in the first bin, and so on. So there are (b+n-1)!/(b-1)! ways.

c. By the hint, arrange n identical balls and b-1 sticks in a row. So there are {n+b-1 \choose n} ways.</p> <p>d. Among the b bins, we choose n bins to place the ball. So there are latex {b \choose n}$ ways.

e. We select b balls for every bin. So there are n-b balls that should be placed in b bins. There are {n-1 \choose b-1} ways.

Exercises C.5-7

Filed under: C.5 — yuhanlyu @ 3:26 pm

Let f(\alpha) be the right hand side of C.45. f'(\alpha) = (\mu e^{\alpha} -r)e^{\mu e^{\alpha} -rx}. Let f'(\alpha) = 0, \alpha = \ln(r/\mu).

Exercises C.5-6

Filed under: C.5 — yuhanlyu @ 3:20 pm

Solution Wanted!

Exercises C.5-5

Filed under: C.5 — yuhanlyu @ 3:19 pm

Solution Wanted!

Exercises C.5-4

Filed under: C.5 — yuhanlyu @ 3:18 pm

Solution Wanted!

Exercises C.5-3

Filed under: C.5 — yuhanlyu @ 3:17 pm

Solution Wanted!

Exercises C.5-2

Filed under: C.5 — yuhanlyu @ 3:17 pm

Solution Wanted!

Exercises C.5-1

Filed under: C.5 — yuhanlyu @ 3:13 pm

Obtaining no heads when you flip a fair coin n times: 2^{-n}.
Obtaining fewer than n heads when you flip the coin 4n times: \sum^n_{k=0}  {4n \choose k}2^{-4n} \leq e^{-n} by Chernoff’s bound.

Hence obtaining fewer than n heads when you flip the coin 4n times is less likely.

March 27, 2007

Exercises C.4-9

Filed under: C.4 — yuhanlyu @ 12:31 pm

Solution Wanted!

Exercises C.4-8

Filed under: C.4 — yuhanlyu @ 12:30 pm

Solution Wanted!

Older Posts »

Blog at WordPress.com.