Birthday paradox

Metadata

• Slug: 00046-birthday-paradox
• Type: PARADOX
• Tags: set-theory, probability
• Sources: 1

Axioms

• Assume the rules of the domain apply uniformly.
• Assume the observer’s criteria remain fixed.
• Assume classification boundaries stay consistent.
• Assume the model describes the real case.
• Assume repeated steps do not change the outcome.
• Assume no hidden variables are introduced midstream.

Contradictions

• Two reasonable lines of inference yield opposite conclusions
• A global rule conflicts with a local judgment
• A stable resolution appears to violate a starting premise
• Changing the framing reverses the outcome
• Intuition and formalism diverge at the same step

Prompts

• Which assumption is doing the most hidden work?
• What changes if you relax the smallest constraint?
• Does the paradox dissolve or relocate when reframed?
• What is conserved, and what is sacrificed?

Notes

Sources

• https://en.wikipedia.org/wiki/Birthday_paradox

Overview

In probability theory, the birthday problem asks for the probability that, in a set of n randomly chosen people, at least two will share the same birthday. The birthday paradox is the counterintuitive fact that only 23 people are needed for that probability to exceed 50%.

Tension

• Two reasonable lines of inference yield opposite conclusions.
• A global rule conflicts with a local judgment.
• A stable resolution appears to violate a starting premise.
• Changing the framing reverses the outcome.
• Intuition and formalism diverge at the same step.

Why It Matters

This entry tests how a stable rule-set can yield unstable conclusions under certain assumptions.

Prompts

• Which assumption is doing the most hidden work?
• What changes if you relax the smallest constraint?
• Does the paradox dissolve or relocate when reframed?
• What is conserved, and what is sacrificed?