Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-14T07:41:18.540Z Has data issue: false hasContentIssue false
  • English
  • Français

The number of ways of grading examination candidates

Published online by Cambridge University Press:  01 August 2016

W. T. Tutte  and
Cedric A. B. Smith
Get access Rights & Permissions [Opens in a new window]

Extract

Candidates are graded by their examination results in some such way as 1st B; 2nd equal A, D; 4th equal C, E; and so on. In how many ways gncan n candidates be graded? This problem was solved by Cayley [1, pp. 374-378] and later by others. It does not seem to be well known, and the following result may be of interest.

Type
Articles
Information
The Mathematical Gazette , Volume 87 , Issue 508 , March 2003 , pp. 34 - 35
Copyright
Copyright © The Mathematical Association 2003

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. Cayley, A., On the theory of the analytical forms called trees, II. Phil. Mag. 18 (1859).CrossRefGoogle Scholar
2. Sloane, N. J. A. and Plouffe, Simon, The encyclopedia of integer sequences, Academic Press (1995).Google Scholar