# A Simulation Study of Extension of Birthday Problem to More Than Two Matches

Published: 26 October 2021| Version 1 | DOI: 10.17632/hrrz7bxsm8.1

Contributor:

Yogesh Yewale## Description

Simulated Data : Minimum Number of Individuals Required to get K-matched tuples in Birthday Problem (K=2,3,...10).

## Files

## Steps to reproduce

1.Set Random number seed. 2.Simulation of Random Integers between 1 to 365 (consider it as a birthday of a person) ,until kth match with any of the earlier recorded birthday is found.(k=2,3,4,5,....10). 3.Record the index at where kth match is found, call it as Xk (k=2,3...10) 4. Repeat the steps 2 ,step3 for 100000 times. 5.Store the dataset in variable mk (k=2,3...10), 6.Nine datasets (m2,m3,..m10) will be created.

## Institutions

Ahmednagar College

## Categories

Probability Model