Thomas Lumley • 11/25/2017

Secret Santa collisions

Read Original

This 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.

0 comments
#algorithms #combinatorics #random permutation
Secret Santa collisions

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
React, useEffect, and Stale Closures: How to Avoid Them with Dependencies and useRef
Jivbcoop • 4 votes
2
Better react-hook-form Smart Form Components
Maarten Hus • 2 votes
3
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook • 1 votes
4
Quoting Thariq Shihipar
Simon Willison • 1 votes
5
Dew Drop – January 15, 2026 (#4583)
Alvin Ashcraft • 1 votes
6
Using Browser Apis In React Practical Guide
Jivbcoop • 1 votes