Locks and keys: How fast can you open several locks with too many keys?
September 02, 2015 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Olivier Marchal
arXiv ID
1509.00844
Category
math.HO
Cross-listed
cs.CR,
math.PR
Citations
0
Venue
arXiv.org
Last Checked
3 months ago
Abstract
This short note is the result of a French "Hippocampe internship" that aims at introducing the world of research to young undergraduate French students. The problem studied is the following: imagine yourself locked in a cage barred with $n$ different locks. You are given a keyring with $N \geq n$ keys containing the $n$ keys that open the locks. In average, how many trials are required to open all locks and get out? The article studies $3$ different strategies and compare them. Implementation of the strategies are also proposed as illustrations of the theoretical results.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.HO
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Quantum GestART: Identifying and Applying Correlations between Mathematics, Art, and Perceptual Organization
R.I.P.
π»
Ghosted
The Mathematical Intelligencer flunks the Olympics
R.I.P.
π»
Ghosted
Non-Euclidean Virtual Reality IV: Sol
R.I.P.
π»
Ghosted
Elitism in Mathematics and Inequality
R.I.P.
π»
Ghosted
From Good to Great: Improving Math Reasoning with Tool-Augmented Interleaf Prompting
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted