You are not currently logged in.
Access JSTOR through your library or other institution:
Greedy Galois Games
Joshua Cooper and Aaron Dutle
The American Mathematical Monthly
Vol. 120, No. 5 (May 2013), pp. 441-451
Published by: Mathematical Association of America
Stable URL: http://www.jstor.org/stable/10.4169/amer.math.monthly.120.05.441
Page Count: 11
You can always find the topics here!Topics: Mathematical sequences, Mathematical induction, Mathematical theorems, Coefficients, Combinatorics, Polynomials, Power series, Approximation, Integers
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
Abstract We show that two duelers with similar, lousy shooting skills (a.k.a. Galois duelers) will choose to take turns firing in accordance with the famous Thue–Morse sequence if they greedily demand their chances to fire as soon as the other’s a priori probability of winning exceeds their own. This contrasts with a result from the approximation theory of complex functions, which says what more patient duelers would do, if they really cared about being as fair as possible. We note a consequent interpretation of the Thue–Morse sequence in terms of certain expansions in fractional bases close to, but greater than, 1.
Copyright the Mathematical Association of America 2013