Message Boards Message Boards

0 Replies
0 Total Likes
View groups...
Share this post:

About integer partitions

Posted 9 years ago


I'm currently trying to understand a paper written by Paul Erdös, dealing with integer partitions (a partition of the integer n is a way of writing n as a sum of positive integers). Thus we denote by p(n) the number of partitions of n, without taking order into account (e.g. p(4) = 5).

This is all you need to know to help me understand Erdös' proof of the fact that ln(p(n)) is equivalent to c*n^(1/2), where c is defined at the top of the paper. I have understood the first part of the proof (if you need a detailed explanation I can give it to you), but I'm stuck with the part where he wrote "Similarly but with slightly longer calculations...".

Any help is welcomed, thank you. (I'm giving you the links below)

POSTED BY: Léo Poirel
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
or Discard

Group Abstract Group Abstract