Year: 2026
Type: article
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 ⌊ N 2 ⌋ ( − 1 2 ) m 1 ! ( N − 2 m ) m ! ( N − 2 m ) ! 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, lim N → ∞ P ( N ) = 1 − 1 e ≈ 0.393469 \lim_{N\to\infty} P(N)=1-\frac{1}{\sqrt{e}}\approx 0.393469 where ! M = M ! ∑ i = 0 M ( − 1 ) i i ! !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.5 k e − 0.5
Authors: Des McLernon, Ali Hayajneh, Ali Zaidi
Institutions: University of Leeds, Hashemite University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7236377009
