A note on the number of partitions of $n$ into $k$ parts

Abstract: We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set ${n\in\mathbb N\;:\;p(n,k)\equiv i(\bmod\; m)}$, where $m\geq 2$ and $0\leq i\leq m-1$.