My Math Forum  

Go Back   My Math Forum > College Math Forum > Advanced Statistics

Advanced Statistics Advanced Probability and Statistics Math Forum

LinkBack Thread Tools Display Modes
October 29th, 2011, 02:54 PM   #1
Joined: Oct 2011

Posts: 1
Thanks: 0

Difficult question!

I have been trying to work on this question but the answer keeps escaping me. I tried creating a binomial tree for various values of k but I still can't figure out the general case for this.

Two bags contain k identical balls each. A game is played where one ball is picked at random(with all
2k balls equally likely to be picked) and moved from the current bag it is in to the other bag. When one
bag is empty, the game stops. If Tk is the number of turns before the game finishes, find an expression
for E[Tk].

Any help or hints would be greatly appreciated!
DragonScion is offline  

  My Math Forum > College Math Forum > Advanced Statistics

difficult, question

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
DIfficult Question, try it Iamthatdude Math Events 1 August 28th, 2013 12:13 PM
difficult question for matrix frankpupu Linear Algebra 0 February 21st, 2012 04:44 PM
Very difficult question (need help) xtifer Economics 18 January 23rd, 2012 02:42 AM
difficult question ahmed-ar Calculus 3 December 9th, 2011 12:44 PM
Difficult question grahamlee Complex Analysis 0 July 27th, 2009 09:56 PM

Copyright © 2018 My Math Forum. All rights reserved.