Counting neighboring pairs in permutations

• المؤلفون الرئيسيون: Terrel, Randolph Anthony A., Tibig, Louela Christine V.
• التنسيق: text
• اللغة: English
• منشور في: Animo Repository 1994
• الموضوعات: Permutations; Programming (Mathematics); Combinations; Equations > Numerical solutions
• الوصول للمادة أونلاين: https://animorepository.dlsu.edu.ph/etd_bachelors/16182

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...