Skip to main content

Give and Take

Source: Gazette of the Australian Mathematical Society

Problem: Two people, Give and Take, divide a pile of one hundred coins between themselves as follows. Give chooses a handful of coins from the pile and Take decides who will get them. This is repeated until all coins have been taken or until one of them has taken nine handfuls. In the latter case, the other person is allowed to take all of the remaining coins in the pile. What is the largest number of coins that Give can be sure of getting?

Update (05/02/10):
Solution: Solution by Aaditya Ramdas (CSE, IITB alumnus & Tower Research) in comments!! Further explained by me in comments!!

Comments

  1. 45.
    Tell me if I can do any better.
    But the simple strategy for Give should be to take 5 coins every time, which ensures that he gets 5x9=45 coins at least.

    ReplyDelete
  2. an even simpler strategy is to keep taking 6. if he starts taking all of them, he'll have 54, ull have 46.

    ReplyDelete
  3. actually u can show, by this very argument, thoda intuitively also, that the best strategy for Take is to take >=6, and give <=5. So ull see that 46 is the highest possible.

    ReplyDelete
  4. Ramdas (Ya, I am a Dastard)'s solution is correct. Its 46. :)

    Strategy:
    "Give" should always put aside 6 coins. If Take takes them, "Give" gets 100-54 = 46. If not, "Give" gets 54 :)

    So, "Give" can ensure getting 46 coins always. Can he do better?

    Suppose he follows any other strategy. Then "Take" will follow the strategy that he will take only if number of coins >= 6. And so, ensure that "Give" gets no more than 46 coins. So, this is the best strategy. :)

    ReplyDelete
  5. I think that there is a flaw in above solution. Suppose, that Give keeps taking the coins till 8 handfuls and then gives the last 6 coins to Give in that 9th handful. So, Give now has only 6 coins and Take has 94

    My solution goes like this:

    strategy : 1 1 1 1 1 1 1 1 46

    Lemma: Suppose that after 8 handful coins have already been picked up, the number of coins to be picked up in the last go is half the remaining number of coins
    Proof of Lemma: If he picks M s.t. M > R/2, where R is the remaining number of coins, then Take will take M. If he picked M s.t. M < R/2, then Take gives it to Give. In both the cases, the number of coins coming on Give's side is less than R/2 which was the case when M=R/2. Hence the lemma is proved.

    Now, Give can always take the coins in first 8 handfuls. So, it is always best to give him the least and to save the maximum number of coins to be picked from in the last handfuls. So, this strategy is the best.

    ReplyDelete
  6. @Kapil,
    I think that the question says that we stop after one person gets 9 handfuls, not after when total 9 handfuls have been picked.

    ReplyDelete

Post a Comment

Popular posts from this blog

Asking a girl out

This is not a puzzle. So, for those of you who follow this puzzle blog, please bear with me for just one post. Interesting Math in this article though :P

Most of my friends already read an article that I wrote more than an year back - "Speak Up"


Here, inspired by the movie, The Beautiful Mind, I give a mathematical analysis of asking a girl out. Nice time it is. Feb 10. No plans for Feb 14 and I am sure this article makes me look even more geekier and all the more reason for me to believe that I will be alone, yet again. But what the hell, lets do it!

Note: This is not an independent analysis. There are many "mathematics sites" which does "similar" analysis.

@Consultants, correct me if I am wrong in my estimates. :P

Why is there a need to be selective?

From the age of 15, I guess there are approximately 3,600 girls I have liked (On average days, I don't see new girls. But going outside, I like about 30 girls. Saying that I go out once every week right …

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process.

1) Calculate P{X>Y}
2) What's the expected value of X
3) What's the expected value of Y

This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment.

Solution:
1)
(Solved by me finally after 13 months :))

Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently.

So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0"

f(State) = P(X>Y | "State" configuration initially)

f(0,0) = 1/4[f(…

Fraction Brainteaser

Source:
Sent to me by Gaurav Sinha

Problem:
Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions. In total, Siddhant scores 25 out of 34. 

Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34.

Note that
a) Vaibhav scores more than Siddhant
b) Siddhant score better than Vaibhav in both individual topics - 5/6 > 20/25 and 20/28 > 6/9

How is it possible?