Timeline for patitions of the number n
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 26, 2015 at 17:49 | comment | added | JMP | my last GF becomes (1+x+x^2+x^3)(1+x^2+x^4+x^6)(1+x^3+x^6+x^9)..., with effectively no denominator, which enumerates into partitions where each part appears at most 3 times. | |
| Aug 26, 2015 at 17:41 | comment | added | jony89 | i understood the math. i dont understand how your result proves the question. where did u show the equality of the number of partitions of the two cases ? mostly i didnt understand where did u show the equality to the 'any number appears at most 3 times' part.. | |
| Aug 26, 2015 at 17:03 | comment | added | JMP | @jony89; which bit don't you get? | |
| Aug 26, 2015 at 17:01 | comment | added | jony89 | im sorry, i didnt understand the solution, how what u showed proves the question.. i understood the steps. could u just show that the generating function of the two cases are equal ? | |
| Aug 26, 2015 at 15:48 | vote | accept | jony89 | ||
| Aug 26, 2015 at 5:44 | comment | added | jony89 | i edited the question | |
| Aug 26, 2015 at 5:28 | comment | added | JMP | @jony89; and i still cant get B to work from your description of it. can you explain n=10 for me, tnx. | |
| Aug 26, 2015 at 5:28 | comment | added | JMP | @jony89; the first generating function uses at most 1 from each even number and any number from each odd. the idea is to show a bijection from this classification to that of 'any number appears at most 3 times', which is represented by my final generating function. | |
| Aug 26, 2015 at 4:39 | comment | added | jony89 | also i made a lil change from : 'the even numbers appears once' to ' the even numbers appears at most once'. | |
| Aug 26, 2015 at 4:37 | comment | added | jony89 | i know what is the generating function, but u said 'any number of any odd numbers' but in the question they ask for at most 3 times of each number in a particular partition. where did u relate to this part of the question ? ('at most 3 times') | |
| Aug 26, 2015 at 4:31 | comment | added | jony89 | if u can answer it, it will be great ! | |
| Aug 26, 2015 at 4:11 | comment | added | JMP | @jony89; also is part B right? | |
| Aug 26, 2015 at 4:10 | comment | added | JMP | you could try mathworld.wolfram.com/PartitionFunctionP.html; en.wikipedia.org/wiki/… and in particular mathworld.wolfram.com/GeneratingFunction.html | |
| Aug 25, 2015 at 19:42 | comment | added | jony89 | i didnt understand where u show that the number of the partitions are equal? where did u even talked about any of the number of the partitions ? | |
| Aug 25, 2015 at 17:25 | history | answered | JMP | CC BY-SA 3.0 |