Counting neighboring pairs in permutations
Date of Publication
1994
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
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.
Abstract Format
html
Language
English
Format
Accession Number
TU06658
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
52 numb. leaves
Keywords
Permutations; Programming (Mathematics); Combinations; Equations--Numerical solutions
Recommended Citation
Terrel, R. A., & Tibig, L. V. (1994). Counting neighboring pairs in permutations. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16182
