Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-24T18:21:22.502Z Has data issue: false hasContentIssue false
  • English
  • Français

80.29 Counting subsets and the binomial theorem

Published online by Cambridge University Press:  01 August 2016

Graham Jameson
Graham Jameson*
Affiliation:
Department of Mathematics and Statistics, Lancaster University LAI 4YF
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 80 , Issue 488 , July 1996 , pp. 395 - 396
Copyright
Copyright © The Mathematical Association 1996

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. Cameron, Peter J., Combinatorics: topics, techniques, algorithms, Cambridge University Press (1994).Google Scholar