Quant Memo
Foundational

The Chevalier de Mere Problem

A 17th-century gambling puzzle about dice that, in getting resolved, helped kick off modern probability theory — and still trips people up as a classic interview question about trusting intuition over calculation.

A 17th-century French gambler, the Chevalier de Mere, noticed something that bothered him: betting on rolling at least one six in four rolls of a single die was profitable over time, but the seemingly "equivalent" bet on rolling at least one double-six in 24 rolls of two dice was a loser. His intuition said the two bets should have the same odds, since 44 is to 66 as 2424 is to 3636 (the same ratio), but experience said otherwise — and he asked Blaise Pascal to explain why, sparking a correspondence with Pierre de Fermat that's often credited as a founding moment of formal probability theory.

The resolution is a straightforward complement calculation. The probability of at least one six in four rolls is 1(5/6)40.5181 - (5/6)^4 \approx 0.518, a favorable bet. The probability of at least one double-six in 24 rolls of two dice is 1(35/36)240.4911 - (35/36)^{24} \approx 0.491, an unfavorable bet. The two numbers look close but land on opposite sides of even odds — de Mere's linear-ratio intuition (that scaling both the target and the number of rolls by the same factor preserves the odds) was simply wrong, because the correct calculation involves a probability raised to a power, not a ratio.

The puzzle endures as an interview question because it's a compact test of whether a candidate reaches for the complement rule (compute the probability of the event not happening, then subtract from 1) rather than trying to directly enumerate "at least one" outcomes, and whether they're suspicious enough of a "looks the same" ratio to actually run the numbers.

The Chevalier de Mere problem shows that at-least-one-six-in-4-rolls (about 51.8%) and at-least-one-double-six-in-24-rolls (about 49.1%) are not equally good bets despite a matching ratio of trials to target, because "at least one" probabilities scale as 1pn1-p^n, not linearly — solve it via the complement rule, and always distrust a same-ratio shortcut on this class of problem.

Related concepts

Practice in interviews

Further reading

  • Pascal-Fermat correspondence, 1654
ShareTwitterLinkedIn