Secret Santa collisions
Read OriginalThis article explores a probability problem related to Secret Santa: the chance that a random permutation results in someone being assigned to give a gift to themselves. It discusses using Bonferroni bounds, simulations in R, and the convergence of the probability of no collisions to approximately 1/e as the number of participants grows.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
The Beautiful Web
Jens Oliver Meiert
•
2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane
•
1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg
•
1 votes
4
Wagon’s algorithm in Python
John D. Cook
•
1 votes
5
An example conversation with Claude Code
Dumm Zeuch
•
1 votes