Hostname: page-component-848d4c4894-p2v8j Total loading time: 0.001 Render date: 2024-06-01T22:47:36.413Z Has data issue: false hasContentIssue false
  • English
  • Français

94.37 Multinomial distributions and knockout tournaments

Published online by Cambridge University Press:  23 January 2015

Martin Griffiths
Martin Griffiths*
Affiliation:
School of Education, University of Manchester, Oxford Road, Manchester M13 9PL
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes 94.26 to 94.40
Information
The Mathematical Gazette , Volume 94 , Issue 531 , November 2010 , pp. 505 - 509
Copyright
Copyright © The Mathematical Association 2010

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. Knuth, D. E., The art of computer programming, Vol. 1, Addison-Wesley (1968).Google Scholar
2. Griffiths, M., The backbone of Pascal's triangle, United Kingdom Mathematics Trust (2008).Google Scholar
3. NRICH website, Cambridge University. http://nrich.maths.org/public/viewer.php?obj\_=328 Google Scholar
4. Griffiths, M., Seeded tournaments - algorithms, simulations and combinatorics, Math. Gaz. 89 (November 2005) pp. 485–490.10.1017/S0025557200178507Google Scholar