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 |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16695 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-166952022-02-02T04:58:21Z Counting neighboring pairs in permutations Terrel, Randolph Anthony A. Tibig, Louela Christine V. 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 numbers. 1994-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16182 Bachelor's Theses English Animo Repository Permutations Programming (Mathematics) Combinations Equations--Numerical solutions |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Permutations Programming (Mathematics) Combinations Equations--Numerical solutions |
| spellingShingle |
Permutations Programming (Mathematics) Combinations Equations--Numerical solutions Terrel, Randolph Anthony A. Tibig, Louela Christine V. Counting neighboring pairs in permutations |
| description |
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 numbers. |
| format |
text |
| author |
Terrel, Randolph Anthony A. Tibig, Louela Christine V. |
| author_facet |
Terrel, Randolph Anthony A. Tibig, Louela Christine V. |
| author_sort |
Terrel, Randolph Anthony A. |
| title |
Counting neighboring pairs in permutations |
| title_short |
Counting neighboring pairs in permutations |
| title_full |
Counting neighboring pairs in permutations |
| title_fullStr |
Counting neighboring pairs in permutations |
| title_full_unstemmed |
Counting neighboring pairs in permutations |
| title_sort |
counting neighboring pairs in permutations |
| publisher |
Animo Repository |
| publishDate |
1994 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16182 |
| _version_ |
1772835000963563520 |