Answers are grounded in this paper and cite their sources.
This analysis explores the expected value of hitting prime sums in dice rolls, revealing insights into distribution patterns as $k$ increases.
Let S=(d₁,d₂,d₃, … ) be an infinite sequence of rolls of independent fair dice. For an integer k ≥ 1, let Lₖ=Lₖ(S) be the smallest i so that there are k integers j ≤ i for which ∑ₜ₌₁ʲ dₜ is a prime. Therefore, Lₖ is the random variable whose value is the number of dice rolls required until the accumulated sum equals a prime k times. It is known that the expected value of L₁ is close to $2.43$. Here we show that for large k, the expected value of Lₖ is (1+o(1)) klogₑ k, where the $o(1)$-term tends to zero as k tends to infinity. We also include some computational results about the distribution of Lₖ for k ≤ 100.
No takes yet. Share an insight, caveat, or question.
Alon et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: