Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-24T14:43:45.843Z Has data issue: false hasContentIssue false

Speedway tournaments

Published online by Cambridge University Press:  22 September 2016

T. J. Fletcher*
Affiliation:
Department of Education and Science, Mowden Hall, Staindrop Road, Darlington DL3 9BG

Extract

I like an active Saturday afternoon, so it comes about that I often end up watching sport on television. The other day it was speedway racing. I gradually became aware that I was watching 16 riders riding four at a time in a complicated arrangement of heats, the object of which was to ensure that each rider rode against every other rider exactly once. Naturally (?) there were 20 heats; but the question arises as to what numbers of riders may be arranged into a tournament, given the firm speedway requirement that four riders are to be on the track at a time, and the requirement that each meets each just once. It is also a problem to arrange the riders into heats suitably.

Type
Research Article
Copyright
Copyright © Mathematical Association 1976

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

References

1. Anderson, I., A first course in combinatorial mathematics. Oxford University Press (1974).Google Scholar
2. Horadara, A. F., A guide to undergraduate projective geomtry. Pergamon Australia (1970).Google Scholar
3. O’Beirne, T. H., Puzzles and paradoxes. Oxford University Press (1965).Google Scholar
4. Room, T. G., A background to geometry. Cambridge University Press (1967).Google Scholar
5. Singer, J., A theorem in finite projective geometry and some applications to number theory, Trans. Am. math. Soc. 43, 377-85 (1938).CrossRefGoogle Scholar
6. Sawyer, W. W., A concrete approach to abstract algebra. Freeman (1959).Google Scholar