There are two urns each containing an arbitrary number of balls. Both are non-empty to begin with. We are allowed two types of operations: (a) remove an equal number of balls simultaneously from the urns, and (b) double the number of balls in any one of them. Show that after performing these operations finitely many times, both the urns can be made empty.
@TessaMarie08181997 @mikaela19900630
i will help you as soon as i am done with math class along with @TessaMarie08181997 we are so sorry we will be back in 15 to 30 mins
Is there more to answer A?
The answer is A if there is more to it or not buit it is a
http://math.stackexchange.com/questions/116312/strategy-in-an-urn-problem-with-two-urns it should be A
but***
Thankyou Madam
your welcome
your welcome
Join our real-time social learning platform and learn together with your friends!