Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I heard this problem in a form like this (it's not exact wording):

There are N bachelors. Girl evaluates each of them one after another to find the best one. She can either chose a current bachelor as a final solution, or she can proceed with the next one. At which moment she should stop?

What's the name of this problem? (i.e. how to google it?) I'm also curious, if there is any approach to solve this problem when number of bachelors is infinite?

share|cite|improve this question
"When the number of bachelors is infinite" needs to be made more specific. In the original problem, there is an ordering of best to worst (assuming you could actually rank all the bachelors). So when you say infinite, are you putting an upper bound on "best?" – Alex R. Oct 2 '12 at 22:05

This type of problem is called an optimal stopping problem.

share|cite|improve this answer

Clio Cresswell calls this the 12 bonk rule and has managed to get it mentioned in the media (refs: Sydney Morning Herald; Catalyst), using the eyecatching title as a means to (a) make mathematics seem more "cool", and (b) attract more females to mathematics.

See also her book "Mathematics and Sex" (refs: Google Books; Amazon).

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.