2. Some classic problems
We are now interested in various aspects of the combinations (or parts) of a finite set N, │N │ = n, whose elements are numbered from 1 to n. We now identify N with the segment of integers
.
Definition 6. A
part is said to be dispersed...
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
Ongoing reading
Some classic problems
References
-
(1) - BERMAN (G.), FRYER (K.) -
Introduction to Combinatorics,
-
Academic Press, 1992. ISBN 70-182646.
-
(2) - CARR (G.) -
Formulas and Theorems in Pure Mathematics,
-
Chelsea Reprint, 1970. ISBN 0-8284-0239-6.
-
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!