Article contents
A Note on Combinations
Published online by Cambridge University Press: 20 November 2018
Extract
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.
- Type
- Notes and Problems
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1966
References
- 2
- Cited by