Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °
You are not logged in.
Post a reply
Topic review (newest first)
All the forms there were obtained empirically. By looking at the data. There just was no other way that I could solve the problem,
That is the number of derangements which is always an integer. Your sum there is not always an integer.
I am trying to understand the logic behind the terms that's all.
Look at the formula for no one getting drunk. The (k-1)! is the number of them.
and why did we have to time that by (k-1)!?
That is quite okay, thank you.
Then please hold on, it will take awhile.
Oh yes please. Thank you .
Hi, sorry for bothering again, but what is j in this case?
I think there's a gamma distribution in there? Unfortunately I haven't learned that yet. Would be okay if you rewrite the formula without the gamma distribution? thank you very much.
If possible, can you please write this in a simplier format? as I don't quite understand these notations. Thank you very much.
Hi, would you be able to show me the working for b, for the general formula of expected number of drunk please? thank you very much .
The programming allows me to play spot the pattern much more than without it. Basically without it the general form produced is very difficult if not impossible for all but the best of the best.