We determine the optimal strategy for a family of lottery games involving repeated drawings with the same conditions, which includes Brazil's jogo do bicho and games typically offered by state lottery organizations in the United States under names such as Daily 4 or Cash 3. The proof that the strategy is optimal and the resulting formula for the probability of success both rely on a solution to a recursion that generalizes the usual Pascal recursion for binomial coefficients, which itself relies on a count of lattice paths. We illustrate how our result can be applied to focus on-the-ground investigations of suspicious patterns of lottery wins.
@article{10_37236_9555,
author = {Richard Stong and Skip Garibaldi},
title = {Optimal play for multiple lottery wins},
journal = {The electronic journal of combinatorics},
year = {2020},
volume = {27},
number = {3},
doi = {10.37236/9555},
zbl = {1460.60027},
url = {http://geodesic.mathdoc.fr/articles/10.37236/9555/}
}
TY - JOUR
AU - Richard Stong
AU - Skip Garibaldi
TI - Optimal play for multiple lottery wins
JO - The electronic journal of combinatorics
PY - 2020
VL - 27
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/9555/
DO - 10.37236/9555
ID - 10_37236_9555
ER -
%0 Journal Article
%A Richard Stong
%A Skip Garibaldi
%T Optimal play for multiple lottery wins
%J The electronic journal of combinatorics
%D 2020
%V 27
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/9555/
%R 10.37236/9555
%F 10_37236_9555
Richard Stong; Skip Garibaldi. Optimal play for multiple lottery wins. The electronic journal of combinatorics, Tome 27 (2020) no. 3. doi: 10.37236/9555
