jgens
Gold Member
- 1,575
- 50
Homework Statement
Suppose 0 < p < 1. Define b(n,k) = \binom{n}{k}p^k(1-p)^k. For what value of k is b(n,k) a maximum?
Homework Equations
N/A
The Attempt at a Solution
Is there any way to get a nice closed form solution to this problem? I've already proved that it has a maximum so there must be some j such that b(n,j) is maximal. Then we know b(n,j+1) < b(n,j) and b(n,j-1) < b(n,j). And I figure we can use these relations to figure out j or something like that. But I'm not sure if this approach will work.
Could someone help me with this please?