Number Of Matches and Matched People in The Birthday Problem

Isaac Meilijson, Uri Yechiali, Marian R. Newborn, Aaron Tenenbein

Research output: Contribution to journalArticlepeer-review

Abstract

The well known birthday problem asks for the probability of at least one match out of a group of n people. Also of interest are the number of matches and the number of matched people. In this paper the means and variances of the number of matches and matched people are obtained. A generalization of the use of these methods to computer storage analysis is discussed.

Original languageEnglish
Pages (from-to)361-370
Number of pages10
JournalCommunications in Statistics Part B: Simulation and Computation
Volume11
Issue number3
DOIs
StatePublished - 1 Jan 1982

Keywords

  • computer storage
  • expected number of matches
  • probability

Fingerprint

Dive into the research topics of 'Number Of Matches and Matched People in The Birthday Problem'. Together they form a unique fingerprint.

Cite this