| A Simple Derivation about the Number of Combinations without Unit Separation |
| Received:March 07, 1985 |
| Key Words:
|
| Fund Project: |
|
| Hits: 1862 |
| Download times: 1510 |
| Abstract: |
| Let f(n, k) denote the number of ways of selecting k objects from n objects arrayed in a line with no two selected having unit separation. Konvalina has proved the following formula |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.1988.01.009 |
| View Full Text View/Add Comment |
