Kaplansky's solution to a counting problem
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1998
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16453 |
| 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-16966 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-169662021-11-13T03:54:02Z Kaplansky's solution to a counting problem Sy, Janel G. 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. 1998-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16453 Bachelor's Theses English Animo Repository Counting Mathematics--Problems, exercises, etc. Sequences (Mathematics) Games |
| 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 |
Counting Mathematics--Problems, exercises, etc. Sequences (Mathematics) Games |
| spellingShingle |
Counting Mathematics--Problems, exercises, etc. Sequences (Mathematics) Games Sy, Janel G. Kaplansky's solution to a counting problem |
| description |
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. |
| format |
text |
| author |
Sy, Janel G. |
| author_facet |
Sy, Janel G. |
| author_sort |
Sy, Janel G. |
| title |
Kaplansky's solution to a counting problem |
| title_short |
Kaplansky's solution to a counting problem |
| title_full |
Kaplansky's solution to a counting problem |
| title_fullStr |
Kaplansky's solution to a counting problem |
| title_full_unstemmed |
Kaplansky's solution to a counting problem |
| title_sort |
kaplansky's solution to a counting problem |
| publisher |
Animo Repository |
| publishDate |
1998 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16453 |
| _version_ |
1772835119516614656 |