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

Full description

Saved in:
Bibliographic Details
Main Author: Sy, Janel G.
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
Be the first to leave a comment!
You must be logged in first