Timeline for Double summation involving partition of a number n as a condition
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 26, 2020 at 11:28 | vote | accept | user74846 | ||
| Sep 26, 2020 at 10:03 | comment | added | J. M.'s missing motivation♦ | That's a different question altogether; since you already asked another question, I don't have to remind you to ask a new one. | |
| Sep 26, 2020 at 8:46 | vote | accept | user74846 | ||
| Sep 26, 2020 at 8:46 | |||||
| Sep 26, 2020 at 6:31 | comment | added | user74846 | @J.M., would you mind addressing the above commented problem? | |
| Sep 25, 2020 at 17:46 | vote | accept | user74846 | ||
| Sep 26, 2020 at 8:46 | |||||
| Sep 25, 2020 at 17:32 | comment | added | user74846 | b_n is 0 for n<6 according to the requirement of a set of calculations. Also, how do I write this expression if we do not ignore that the partition is same if the order is changed? For example: [1,1,2] is not same as [1,2,1] is not same as [2,1,1]. Then how do I count all such possibilities in the summation involving a_{i_k}s? | |
| S Sep 25, 2020 at 17:17 | history | answered | J. M.'s missing motivation♦ | CC BY-SA 4.0 | |
| S Sep 25, 2020 at 17:17 | history | made wiki | Post Made Community Wiki by J. M.'s missing motivation♦ |