I’ve previously discussed some mathematical approaches to dating. Specifically, we have seen how choosing a partner can be modeled as a type of secretary problem, and, if you like, you can estimate the number of candidates you should consider by using a modified Drake’s equation. However, as you know, building a lasting relationship is about more . . . → Read More: Love and Marriage
|
|||||
|
Some time ago, I wrote an article on the optimal way to select a mate, assuming you know how many eligible partners exist, and that once you’ve dated someone, you can’t go back and date them again (sorry, Drew Barrymore and that dude from the Apple commercials). This is less romantically known as the secretary problem. . . . → Read More: Finding Love with a Modified Drake’s Equation |
|||||
|
Copyright © 2010 Math Goes Pop! - All Rights Reserved |
|||||
