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: | , |
---|---|
格式: | text |
語言: | English |
出版: |
Animo Repository
1994
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/16182 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | De La Salle University |
語言: | English |