Talk:Birthday paradox

Citable Version ^[?]

To learn how to update the categories for this article, see here. To update categories, edit the metadata template.

Definition: The counterintuitive result that for any (random) group of 23 or more people it is more likely than not that two of them celebrate their birthday on the same day of the year. [d] [e]

Checklist and Archives

Workgroup category: Mathematics [Categories OK]
Talk Archive: none	English language variant: British English

Unused subpages
Unused subpages: - External Links - Works - Discography - Filmography - Catalogs - Timelines - Gallery - Audio - Video - Code - Tutorials - Student Level - Signed Articles - Function - Addendum - Debate Guide - Advanced - Recipes - Citable Version

Table for data

Is there an easy way to put data, like in this article, into a table? --David W Gillette 14:55, 21 July 2007 (CDT)

I've just put your data into a table - have a look at how it's constructed. Anthony Argyriou 10:58, 22 July 2007 (CDT)

Thanks, it looks great.--David W Gillette 15:45, 22 July 2007 (CDT)

Is there a mathematician in the house?

I've just added an article birthday attack on a cryptographic application of the birthday paradox, with a link from here.

Part of the text there is: "In general, for a cryptographic primitive of size n bits, the attack cost is 2^n/2." That's a well-known rule among crypto folk; it's in the standard references and is used in government standards, see the last paragraph of birthday attack. However, I've never seen a proof and do not know if it is a theorem or just a handy approximation. Can anyone clarify this? Sandy Harris 13:32, 1 November 2008 (UTC)

Talk:Birthday paradox

Table for data

Is there a mathematician in the house?

Navigation menu

Search