The Workshop “ICEBREAKER EVENT” problem

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

Institutions

Publication Details

Journal
Recreational mathematics magazine
Published
2026-11-17
DOI
https://doi.org/10.2478/rmm-2026-0009
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

The Workshop “ICEBREAKER EVENT” problem

Des McLernon, Ali Hayajneh, Ali Zaidi
Recreational mathematics magazine
Advanced Combinatorial Mathematics
article

The Workshop “ICEBREAKER EVENT” problem

Des McLernon, Ali Hayajneh, Ali Zaidi
article en

Abstract

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

Recreational mathematics magazineVol. 13(23)
University of Leeds (GB), Hashemite University (JO)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon