October 27th, 2010, 7:12 pm
I think this problem can be set up recursively.For i), if we define the event of picking up a ball of the same color as the first as A, then... E[A] = (1/5)(1) + (4/5)(E[A]+1) => (1/5)E[A] = 1 => E[A] = 5For ii), we generalize the results from i)... E[A] = (p_i)(1) + (1-p_i)(E[A] + 1) => (p_i)E[A] = 1 => E[A] = 1/p_iOf course, the above method is working under the assumption that the distribution of picking up a specific colored ball doesn't change (aka a large urn with a huge number of balls).
Last edited by
cvkmndfv on October 26th, 2010, 10:00 pm, edited 1 time in total.