Skip to main content
Have a personal or library account? Click to login
The Workshop “ICEBREAKER EVENT” problem Cover
Open Access
|Nov 2026
Read online

Abstract

We assume that N different people have N different name badges. Let the N name badges be randomly redistributed among the N individuals so that nobody now has their own (correct) name badge (i.e., a derangement of N objects). We define P(N ) as the probability that after the derangement at least one pair of individuals will have swapped their name badges (i.e., one or more “swapped pairs”). We will show that: a) P(N)=−N!!N∑m=1⌊N2⌋(−12)m1!(N−2m)m!(N−2m)! P(N)=-\frac{N!}{!N}\sum_{m=1}^{\lfloor N/2\rfloor}\left(-\frac{1}{2}\right)^m\frac{1!(N-2m)}{m!(N-2m)!} , N ⩾ 2, limN→∞P(N)=1−1e≈0.393469 \lim_{N\to\infty} P(N)=1-\frac{1}{\sqrt{e}}\approx 0.393469 where !M=M!∑i=0M(−1)ii! !M=M!\sum_{i=0}^{M}\frac{(-1)^i}{i!} represents the number of possible derangements of M objects. b) In addition, if we define K(N) ⩾ 0 as the discrete random variable that gives the number of swapped pairs in any randomly chosen derangement of N objects, then Prob(K(N)=k)≈0.5ke−0.5k! \operatorname{Prob}(K(N)=k) \approx \frac{0.5^k e^{-0.5}}{k!} ; k=0,1,2,…,K(N)¯=0.5(N!!N)(!(N−2)(N−2)!) k = 0,1,2,\ldots,\quad \overline{K(N)} = 0.5\left(\frac{N!}{!N}\right)\left(\frac{!(N-2)}{(N-2)!}\right) and limN→∞K(N)¯=E(K(N))=0.5. \lim_{N\to\infty}\overline{K(N)} = E(K(N)) = 0.5. .

Language: English
Page range: 41 - 56
Published online: Nov 17, 2026
Published in print: Dec 1, 2026
Published by: Ludus Association
In partnership with: Paradigm Publishing Services

© 2026 Des McLernon, Ali Hayajneh, Ali Zaidi, published by Ludus Association
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.