Timeline for n balls, k colors, expected color change problem [closed]
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2013 at 23:11 | history | closed |
fedja Gjergji Zaimi Douglas Zare Benoît Kloeckner Tony Huynh |
off topic | |
| May 25, 2013 at 21:43 | answer | added | user33772 | timeline score: 2 | |
| May 25, 2013 at 15:51 | history | edited | siolag161 | CC BY-SA 3.0 |
added 140 characters in body
|
| May 25, 2013 at 13:34 | comment | added | fedja | Your "changes" should be "groups", if you want the answer 3 rather than 2 in your example, though the counts always just differ by 1. Hint: the expectation of the sum is the sum of the expectations no matter what, so just look at each adjacent pair of balls separately (they are all the same, really). Another hint: use AoPS rather than MO for discussions of such problems. Voting to close. | |
| May 25, 2013 at 13:07 | history | asked | siolag161 | CC BY-SA 3.0 |