Counting neighboring pairs in permutations
This thesis presents in a simplified, but detailed manner, the derivation of the formula for the probability that a permutation of the set (1, 2, 3, lll, n) contains exactly k neighboring pairs.In addition, the researchers provide a computer program to help the readers in the computation of these nu...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1994
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16182 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |