Timeline for What are the best known bounds on the number of partitions of $n$ into exactly $k$ distinct parts?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 10, 2011 at 12:07 | comment | added | Mark Wildon | I like the argument for the lower bound, but I suspect that some restriction on $k$ is needed. For instance, if $k$ is of the order $\sqrt{n}$ then, by the Birthday Paradox, it will be likely that two of the $a_j$ are equal. Then the error introduced by discarding sequences with repeated elements will be appreciable. | |
| Aug 9, 2011 at 17:36 | history | edited | Rob | CC BY-SA 3.0 |
added 1 characters in body
|
| Aug 9, 2011 at 17:29 | history | answered | Rob | CC BY-SA 3.0 |