Two birthday problems

Borek D. Puza, Terence J. O'Neill

Research output: Contribution to journalArticleResearchpeer-review

1 Citation (Scopus)

Abstract

This article focuses on two birthday problems which naturally follow from the most common birthday problems taught in statistics courses. The solutions to these new problems provide a good illustration of several combinatorial techniques.

Original languageEnglish
Pages (from-to)415-422
Number of pages8
JournalCommunications in Statistics - Theory and Methods
Volume35
Issue number3
DOIs
Publication statusPublished - 14 Mar 2006
Externally publishedYes

Fingerprint

Birthday Problem
Statistics

Cite this

@article{0e38022cec2b4224b9972421fe1e78ca,
title = "Two birthday problems",
abstract = "This article focuses on two birthday problems which naturally follow from the most common birthday problems taught in statistics courses. The solutions to these new problems provide a good illustration of several combinatorial techniques.",
author = "Puza, {Borek D.} and O'Neill, {Terence J.}",
year = "2006",
month = "3",
day = "14",
doi = "10.1080/03610920500476333",
language = "English",
volume = "35",
pages = "415--422",
journal = "Communications in Statistics - Theory and Methods",
issn = "0361-0926",
publisher = "Taylor & Francis",
number = "3",

}

Two birthday problems. / Puza, Borek D.; O'Neill, Terence J.

In: Communications in Statistics - Theory and Methods, Vol. 35, No. 3, 14.03.2006, p. 415-422.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Two birthday problems

AU - Puza, Borek D.

AU - O'Neill, Terence J.

PY - 2006/3/14

Y1 - 2006/3/14

N2 - This article focuses on two birthday problems which naturally follow from the most common birthday problems taught in statistics courses. The solutions to these new problems provide a good illustration of several combinatorial techniques.

AB - This article focuses on two birthday problems which naturally follow from the most common birthday problems taught in statistics courses. The solutions to these new problems provide a good illustration of several combinatorial techniques.

UR - http://www.scopus.com/inward/record.url?scp=33644803957&partnerID=8YFLogxK

U2 - 10.1080/03610920500476333

DO - 10.1080/03610920500476333

M3 - Article

VL - 35

SP - 415

EP - 422

JO - Communications in Statistics - Theory and Methods

JF - Communications in Statistics - Theory and Methods

SN - 0361-0926

IS - 3

ER -