Kaplansky's solution to a counting problem
Date of Publication
1998
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 the complete solutions and proofs to a counting problem which is gambling game in particular. The game is all about the proper arrangement of the numbers around a circle that would give a player the minimum triple sum to become a winner. The lemmas and theorem that was stated was proven. Definitions for arithmetic mean, circular permutation, probability and the likes are provided for better understanding of the solution.
Abstract Format
html
Language
English
Format
Accession Number
TU08313
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
54 leaves
Keywords
Counting; Mathematics--Problems, exercises, etc.; Sequences (Mathematics); Games
Recommended Citation
Sy, J. G. (1998). Kaplansky's solution to a counting problem. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16453
