## Welcome to BrainDen.com - Brain Teasers Forum

Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account. As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends. Of course, you can also enjoy our collection of amazing optical illusions and cool math games. If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top. If you have a website, we would appreciate a little link to BrainDen. Thanks and enjoy the Den :-) |

# Who gets a free dinner?

### #1

Posted 22 March 2013 - 10:48 PM

You have only a fair coin, and the method has to treat everyone equally.

It must be absolutely fair and unbiased.

There might be many ways; bonus points await methods with originality, flair, and minimization of flips.

Pick one person out of n, fairly, with a sequence of fair coin tosses.

*Vidi vici veni.*

### #2

Posted 22 March 2013 - 11:19 PM

### #3

Posted 23 March 2013 - 12:01 AM

**Edited by Rob_Gandy, 23 March 2013 - 12:02 AM.**

### #4

Posted 23 March 2013 - 12:04 AM

Spoiler for

OK, that works. Any others? What if n was large? Like 100.

*Vidi vici veni.*

### #5

Posted 23 March 2013 - 12:04 AM

Thought about it some more I I think I have an algorithm that would do it more efficiantly

### #6

Posted 23 March 2013 - 12:17 AM Best Answer

### #7

Posted 23 March 2013 - 12:25 AM

Spoiler for A Third Way

I'll take that.

Very nice.

*Vidi vici veni.*

### #8

Posted 23 March 2013 - 12:49 AM

Spoiler for A Third Way

Question

### #9

Posted 23 March 2013 - 05:18 AM

You're out with friends at Chuck's Steak House and decide to flip a coin to select one person get a free dinner. The bill will be split n-1 ways instead of n ways. Since I was not invited, I don't know how many are in the group. (Maybe next time you'll include me; I love Chuck's place.) So anyway, your selection method has to work for an arbitrary numbers of participants.

You have only a fair coin, and the method has to treat everyone equally.

It must be absolutely fair and unbiased.

There might be many ways; bonus points await methods with originality, flair, and minimization of flips.

Pick one person out of n, fairly, with a sequence of fair coin tosses.

I'm trying to go for the minimum expected number of flips here. This is my best attempt so far

### #10

Posted 23 March 2013 - 08:20 AM

I want to be a party pooper.

Thought about it some more I I think I have an algorithm that would do it more efficiantly

Spoiler for

This one is unfair.

Spoiler for A Third Way

Nice. However, as Bushindo has noticed this one may require replay for number of participants other than power of 2. So there is no ceiling on how many coin throws decide the winner.

You're out with friends at Chuck's Steak House and decide to flip a coin to select one person get a free dinner. The bill will be split n-1 ways instead of n ways. Since I was not invited, I don't know how many are in the group. (Maybe next time you'll include me; I love Chuck's place.) So anyway, your selection method has to work for an arbitrary numbers of participants.

You have only a fair coin, and the method has to treat everyone equally.

It must be absolutely fair and unbiased.

There might be many ways; bonus points await methods with originality, flair, and minimization of flips.

Pick one person out of n, fairly, with a sequence of fair coin tosses.

I'm trying to go for the minimum expected number of flips here. This is my best attempt so far

Spoiler for

Awesome. Same problem though – no ceiling. And it seems fair, but not in an obvious way. A proof of fairness would be nice.

Past prime, actually.

#### 0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users