Note on a min-max problem of leo moser

Saharon Shelah*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Moser asks how a pair of (n+1)-sided dice should be loaded (identically) so that on throwing the dice the frequency of the most frequently occurring sum is as small as possible. G. F. Clements finds a relative minimum, conjecturing that it is always the solution. This conjecture is disproved for n=3.

Original languageEnglish
Pages (from-to)298-300
Number of pages3
JournalJournal of Combinatorial Theory
Volume6
Issue number3
DOIs
StatePublished - Apr 1969

Fingerprint

Dive into the research topics of 'Note on a min-max problem of leo moser'. Together they form a unique fingerprint.

Cite this