The Gompertz approximation conjecture for ties in the M&M Game
Statement
Let denote the probability of a tie in the M\textup{&}M Game, where the probability of flipping heads evolves according to an exponential distribution, and let be the rate parameter controlling how quickly that probability increases as M\textup{&}M's are depleted. For large , the Gompertz approximation conjecture. the probability of a tie is primarily governed by and satisfies
This is an empirical approximation motivated by simulation results and a Gompertz curve fit; the supplied text gives no proof or resolution, so its status remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.