Math question: If I have N N-sided dice (e.g. 100d100) and I roll them repeatedly, removing any that roll maximum (e.g. 100), what is the expected number of rolls until I have none left, in terms of N?
My Scala simulation code (fixed to work, I think), fwiwhttps://gist.github.com/avi-stripe/6eb925629e1ae8352552242ef7cf3ede …
-
-
Ooh tail recursion. Fancy.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Unless my sim is very wrong it's not close to N^2 actually. Results are in the 400-700 range.
-
Yes, agreed, sorry - N^2 was from a dumb mistake I made. The results I get currently are ~14 for d6 (which is close to 6/6+6/5+6/4+6/3+6/2+6/1), 28 for d10, 519 for d100, 1176 for d200.
-
Yeah, I'm at 517 for d100.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.