Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-28T15:00:42.824Z Has data issue: false hasContentIssue false
  • English
  • Français

89.45 A binomial identity, via derangements

Published online by Cambridge University Press:  01 August 2016

Leo Chao ,
Paul DesJarlais  and
John L. Leonard
Leo Chao
Affiliation:
Computer Science Department, University of Arizona, Tucson, AZ 85721, e-mail: [email protected]
Paul DesJarlais
Affiliation:
Mathematics Department, Amphitheater High School, Tucson, AZ 85705, e-mail: [email protected]
John L. Leonard
Affiliation:
Mathematics Department, University of Arizona, Tucson, AZ 85721, e-mail: [email protected]
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
Information
The Mathematical Gazette , Volume 89 , Issue 515 , July 2005 , pp. 268 - 270
Copyright
Copyright © The Mathematical Association 2005

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. Tucker, Alan Applied combinatorics, (3rd edn.), Wiley (1995) p. 334.Google Scholar
2. Harris, John Hirst, Jeffrey and Mossinghoff, Michael Combinatorics and graph theory, Springer (2000).Google Scholar