Timeline for Problem about expectation of maximum partial sum
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23, 2012 at 5:28 | comment | added | Aaron Meyerowitz | It is built in. >with(combinat): then >composition(5,3); will return {[1, 1, 3], [1, 2, 2], [1, 3, 1], [2, 1, 2], [2, 2, 1], [3, 1, 1]}. You can see how it is programmed by restarting putting in >with(combinat): >interface(verbosepreoc=3): then >print(combination): (Restart to avoid seeing extensive remembered results!) It is pretty short. | |
| Jan 22, 2012 at 5:03 | comment | added | Fan Zhang | Could you please post your maple program to calculate the Cn？ | |
| Jan 20, 2012 at 19:38 | history | edited | Aaron Meyerowitz | CC BY-SA 3.0 |
added 390 characters in body
|
| Jan 19, 2012 at 19:42 | history | edited | Aaron Meyerowitz | CC BY-SA 3.0 |
added 248 characters in body; added 4 characters in body
|
| Jan 19, 2012 at 5:13 | history | answered | Aaron Meyerowitz | CC BY-SA 3.0 |