A Note on Combinations
- 1 December 1966
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 9 (5) , 675-677
- https://doi.org/10.4153/cmb-1966-082-5
Abstract
We call k integers x1 < x2 … < xk chosen from 1, 2, …, n} a k-choice (combination) from n. With 1, 2, …, n arranged in a circle, so that 1 and n are consecutive, we have a circular k-choice from n. A part of a k-choice from n is a sequence of consecutive integers not contained in a longer one. Let denote the number of circular k-choices from n with exactly r parts all ≤ w.Keywords
This publication has 2 references indexed in Scilit:
- Restricted ChoicesCanadian Mathematical Bulletin, 1965
- Permutations without 3-sequencesBulletin of the American Mathematical Society, 1945