Hostname: page-component-77c89778f8-7drxs Total loading time: 0 Render date: 2024-07-18T07:33:01.880Z Has data issue: false hasContentIssue false
  • English
  • Français

A Number Problem

Published online by Cambridge University Press:  21 January 2009

N. Y. Wilson
N. Y. Wilson
Affiliation:
35 Spottiswoode Road, Edinburgh, 9
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A and B study an array of counters, placed in straight lines on a table, in separated groups (e.g. 28, 53, 1, 16). The counters are to be removed under the following conditions :–

Each “player” may take away

(1) one counter from anywhere (e.g. 27, 53, 1, 16) or (28, 20, 32, 1, 16) etc.

or (2) three counters from anywhere (e.g. 28, 53, 14) or (27, 52, 1, 15) or (28, 25, 17, 6, 2, 1, 16) etc.

or (3) two adjacent counters from one group (e.g. 28, 51, 1, 16) or (28, 53, 1, 8, 6) etc.

Type
Research Article
Information
Edinburgh Mathematical Notes , Volume 42 , November 1959 , pp. 11 - 14
Copyright
Copyright © Edinburgh Mathematical Society 1959