Description: The Birthday Problem. There is a more than even chance that out of 23 people in a room, at least two of them have the same birthday. Mathematically, this is asserting that for K = 2 3 and N = 3 6 5 , fewer than half of the set of all functions from 1 ... K to 1 ... N are injective. This is Metamath 100 proof #93. (Contributed by Mario Carneiro, 17-Apr-2015)
Ref | Expression | ||
---|---|---|---|
Hypotheses | birthday.s | |
|
birthday.t | |
||
birthday.k | |
||
birthday.n | |
||
Assertion | birthday | |