Answers are grounded in this paper and cite their sources.
Randomized analysis predicts hitting time for cumulative sums via dynamic programming, suggesting new computation methods.
We study the expected number of rolls required for the cumulative sum of a fair six-sided die to first enter a prescribed target set H⊂Z≥0. A one-variable dynamic-programming formulation is introduced that removes dependence on the roll count. Within this framework, the infinite process is truncated at a large cutoff N and corrected by an analytically derived overshoot term that accounts for the rare event of exceeding N before entering H. Explicit bounds on this residual yield a strict two-sided estimate of the truncation error. The method is numerically efficient, requiring constant memory and linear time in the cutoff. For the perfect-square target set H={n2:n∈N}, all quantities are evaluated explicitly, yielding E[T]=7.07976423755110510389555305690818489468…, provably correct to 1017 decimal places. This constitutes the most precise result known to date and establishes a general framework for high-accuracy computation of discrete hitting times.
No takes yet. Share an insight, caveat, or question.
Krityakierne et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: