Two new combinatorial problems involving dominating sets for lottery schemes
Grundlingh, Werner R.
MetadataShow full item record
Suppose a lottery scheme consists of randomly selecting an unordered winning n-subset from a universal set of m numbers, while a player participates in the scheme by purchasing a playing set of any number of unordered n-subsets from the same universal set prior to a winning draw, and is awarded a prize if ...
Please cite this item using this persistent URLhttp://hdl.handle.net/10019.1/1388
The following license files are associated with this item: