Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-05-14T08:00:41.930Z Has data issue: false hasContentIssue false
  • English
  • Français

On a Problem of L. Moser

Published online by Cambridge University Press:  20 November 2018

Irwin Guttman
Irwin Guttman*
Affiliation:
McGill University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In [l], Moser derives a recurrence relation and studies the limiting behaviour of the Expectations En of the following game. “A real number is drawn at random from [0,1]. We may either keep the number selected, or reject it and draw again. We can then either keep the second number chosen or reject it, and draw again, and so on. Suppose we have at most n choices. What stopping rule gives the largest En and how can we estimate En?”

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 3 , Issue 1 , 01 January 1960 , pp. 35 - 39
Copyright
Copyright © Canadian Mathematical Society 1960

References

1. Moser, Leo, On a problem of Cayley, Scripta Mathematica 11 (1956), 289-292.Google Scholar
2. Hastings, Cecil Jr., Approximations for Digital Computers, (Princeton,1955).Google Scholar