Sylver coinage

Sylver coinage

Sylver Coinage is a mathematical game for two players, invented by John H. Conway. It is discussed in"Winning Ways for your Mathematical Plays".

The two players take it in turn to name a positive integer that is not the sum of multiples of previously named integers. After 1 is named, all positive integers can be expressed in this way:1=1, 2=1+1, 3=1+1+1, etc., ending the game. The player who named 1 loses. This makes Sylver Coinage a misère game, since by the usual convention in combinatorial game theory the last player able to move is the winner.

A sample game between A and B:
* A opens with 5. Now neither player can name 5, 10, 15, ....
* B names 4. Now neither player can name 4, 5, 8, 9, 10, or any number greater than 11.
* A names 11. Now the only remaining numbers are 1, 2, 3, 6, and 7.
* B names 6. Now the only remaining numbers are 1, 2, 3, and 7.
* A names 7. Now the only remaining numbers are 1, 2, and 3.
* B names 2. Now the only remaining numbers are 1 and 3.
* A names 3, leaving only 1.
* B is forced to name 1 and loses.

(A must have known what he was doing here: each one of his moves was to a winning position!)

Sylver Coinage is named after
James Joseph Sylvester, who proved that if "a" and "b"are relatively prime positive integers, then ("a" − 1)("b" − 1) − 1 is the largest number that is not a sum of nonnegative multiples of "a" and "b."

Unlike many mathematical games of its ilk, Sylver Coinage has not been completely solved. Part of the difficulty arises from the fact that many positions have infinitely many possible moves. Furthermore, the main theorem that identifies a class of winning positions is nonconstructive, so that even though you may know that you have a winning move, you are not told what it is. For instance, it is known that any of the prime numbers 5, 7, 11, 13, etc. are winning openings for the first player, but very little is known about the subsequent moves which will consummate the win. Complete winning strategies are known to respond to the losing openings 1, 2, 3, 4, 6, 8, 9, and 12.

References

James J. Sylvester, "Mathematical Questions from the Educational Times" 41 (1884), 21 (question 7382).

External links

Some recent findings about the game are detailed at http://www.monmouth.com/~colonel/sylver/.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Winning Ways for your Mathematical Plays — (Academic Press, 1982), est un livre écrit par Elwyn Berlekamp, John Conway, et Richard Guy, qui rassemble l ensemble de leurs résultats sur les jeux mathématiques. Avec On Numbers and Games, ce livre est considéré comme fondateur de la théorie… …   Wikipédia en Français

  • Misère — Misere or misère (French for destitution ; equivalent terms in other languages include bettel, contrabola, devole, null, pobre) is a bid in various card games, and the player who bids misere undertakes to win no tricks or as few as possible,… …   Wikipedia

  • Winning Ways for your Mathematical Plays — (Academic Press, 1982) by Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy is a compendium of information on mathematical games. It was first published in 1982 in two volumes.The first volume introduces combinatorial game theory and its… …   Wikipedia

  • Combinatorial game theory — This article is about the theory of combinatorial games. For the theory that includes games of chance and games of imperfect knowledge, see Game theory. Mathematicians playing Konane at a Combinatorial game theory workshop (for technical content …   Wikipedia

  • List of combinatorics topics — This is a list of combinatorics topics.A few decades ago it might have been said that combinatorics is little more than a way to classify poorly understood problems, and some standard remedies. Great progress has been made since 1960.This page is …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Coin problem — With only 2 pence and 5 pence coins, one cannot make 3 pence, but one can make any higher amount. The coin problem (also referred to as the Frobenius coin problem or Frobenius problem, after the mathematician Ferdinand Frobenius) is a… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”