Hostname: page-component-745bb68f8f-l4dxg Total loading time: 0 Render date: 2025-01-27T02:39:23.681Z Has data issue: false hasContentIssue false
  • English
  • Français

Note on Selected Combinations

Published online by Cambridge University Press:  15 September 2014

Thomas Muir
Get access

Extract

(1) Having formed from n things all possible sets of r, we may subject each of the Cn,r sets to the test of fulfilling one or more conditions, and so obtain a reduced number possessing a special characterisation. The present note deals with a few instances of this in which the reduced number is of the same algebraical form as the full number, that is to say, is a combinatorial Ca,b.

Type
Proceedings
Information
Proceedings of the Royal Society of Edinburgh , Volume 24 , 1904 , pp. 102 - 104
Copyright
Copyright © Royal Society of Edinburgh 1904

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

page 102 note * An analogous peculiarity appears in the well-known theorem that the number of combinations of n things taken r at a time when repetitions are allowed is the same as the number of combinations of n − r + 1 things with repetitions debarred, i.e., is equal to Cn−r+1,r.