Abstract We investigate the following puzzle and several variations, some of which have quite surprising answers. Alice and Bob are in prison under the care of warden Charlie. Alice will be brought into Charlie’s office and shown 52 cards, face-up in a row in an arbitrary order. Alice can interchange two cards. Charlie then turns all cards face-down in their places and Alice leaves the room. Then Bob is brought in and Charlie calls out a random target card. Bob can turn over cards, one after another, at most 26 times as he searches for the target. Both prisoners are freed if Bob finds the target. Find a strategy that never fails.
[1]
Stan Wagon.
Round Formulas for Exponential Polynomials and the Incomplete Gamma Function
,
2016,
Integers.
[2]
S. Plouffe.
Exact Formulas for Integer Sequences
,
2014
.
[3]
J. Lagarias.
Euler's constant: Euler's work and modern developments
,
2013,
1303.1856.
[4]
Peter Winkler.
Mathematical Mind-Benders
,
2007
.
[5]
N. J. A. Sloane,et al.
The On-Line Encyclopedia of Integer Sequences
,
2003,
Electron. J. Comb..
[6]
L. A. Shepp,et al.
Ordered cycle lengths in a random permutation
,
1966
.