Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-12-01T03:34:50.040Z Has data issue: false hasContentIssue false
  • English
  • Français

A Generalized Permutation Problem

Published online by Cambridge University Press:  03 November 2016

R. L. Goodstein
R. L. Goodstein*
Affiliation:
University of Leicester
Get access Rights & Permissions [Opens in a new window]

Extract

In Note 2590 (Gazette 1956) I gave a very simple method for constructing a ring of 2n 0’s and 1’s in such a way that each set of consecutive n digits formed a unique number in the scale of 2. For instance with n = 4, the cycle 0111101100101000 provides in turn the numbers 0111 = 7, 1111 = 15, 1110 = 14, 1101 = 13, 1011 = 11, 0110 = 6, 1100 = 12, 1001 = 9, 0010 = 2, 0101 = 6, 1010 = 10, 0100 = 4, 1000 = 8, 0000 = 0, 0001 = 1, 0011 = 3.

Type
Research Article
Information
The Mathematical Gazette , Volume 54 , Issue 389 , October 1970 , pp. 266 - 267
Copyright
Copyright © Mathematical Association 1970

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)