Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-04T22:18:25.524Z Has data issue: false hasContentIssue false

How Many Different Keys?

Published online by Cambridge University Press:  03 November 2016

C. A. Coulson*
Affiliation:
Mathematical Institute, 24-29 St Giles, Oxford OX1 3LB

Extract

The profile of a familiar type of key is shown in Fig. la. The shape of the key profile is determined by the depths of successive cuts. Each cut is of wedge shape. The centres of the cuts lie at N regular well-defined positions. In the key shown there are 6 cuts (N = 6). The depths d of these cuts, which distinguish one key from another, must have one of a set D of well-defined values. If we regard a cut of zero depth as defined by d = 1, the key shown may have values d = 1, 2, …, 6, 7 (D = 7).

Type
Research Article
Copyright
Copyright © Mathematical Association 1969

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.)