Note on a min-max problem of leo moser

Saharon Shelah

doi:10.1016/S0021-9800(69)80090-6

Note on a min-max problem of leo moser

Saharon Shelah^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	298-300
Number of pages	3
Journal	Journal of Combinatorial Theory
Volume	6
Issue number	3
DOIs	https://doi.org/10.1016/S0021-9800(69)80090-6
State	Published - Apr 1969

Access to Document

10.1016/S0021-9800(69)80090-6

Cite this

@article{2941cc1f43ba421cb20dbd583fb996ea,

title = "Note on a min-max problem of leo moser",

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

author = "Saharon Shelah",

year = "1969",

month = apr,

doi = "10.1016/S0021-9800(69)80090-6",

language = "אנגלית",

volume = "6",

pages = "298--300",

journal = "Journal of Combinatorial Theory",

issn = "0021-9800",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Note on a min-max problem of leo moser

AU - Shelah, Saharon

PY - 1969/4

Y1 - 1969/4

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

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

UR - https://www.scopus.com/pages/publications/58149415867

U2 - 10.1016/S0021-9800(69)80090-6

DO - 10.1016/S0021-9800(69)80090-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:58149415867

SN - 0021-9800

VL - 6

SP - 298

EP - 300

JO - Journal of Combinatorial Theory

JF - Journal of Combinatorial Theory

IS - 3

ER -

Note on a min-max problem of leo moser

Abstract

Access to Document

Other files and links

Fingerprint

Cite this