OFFSET
0,1
COMMENTS
Consider the following game: A and B are two players, each having exactly one turn.
A goes first. A chooses random numbers (uniformly distributed in [0,1]) and adds them until he stops. If the sum exceeds 1, A loses and B wins.
If the sum of A's numbers does not exceed 1, then B proceeds as A did, choosing random numbers sequentially until the sum of B's numbers exceeds the sum of A's numbers. If the sum of B's numbers exceeds 1, B loses and A wins; otherwise B wins and A loses.
The optimal strategy for A is to stop as soon as the sum exceeds this constant.
LINKS
MathStackExchange, An Interesting Two Players' Game Involving Cumulative Sum of Uniform Distribution, Novembre 2016.
EXAMPLE
0.57055652829519647682513101513337478687738690879223085847910287791927497276...
MATHEMATICA
RealDigits[x/.FindRoot[E+x+E^x (-3+2 x)==0, {x, 0.3}, WorkingPrecision-> 120]][[1]]
PROG
(PARI) solve(x=0, 1, exp(1) + x + exp(x)*(2*x-3)) \\ Michel Marcus, Dec 11 2017
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
José María Grau Ribas, Nov 28 2017
EXTENSIONS
Mathematica program corrected by Harvey P. Dale, Dec 08 2019
STATUS
approved