Problem

Source: Iran 3rd round 2011-combinatorics exam-p3

Tags: logarithms, combinatorics proposed, combinatorics



Suppose that $p(n)$ is the number of partitions of a natural number $n$. Prove that there exists $c>0$ such that $P(n)\ge n^{c \cdot \log n}$. proposed by Mohammad Mansouri