Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Let $p(n,m)$ be the number of partitions of the integer $n$ into exactly $m$ parts. Consider the sequence $a_n = p(n,m)$. What is known about the sequence $a_n$ mod $k$? In particular, is it known/obvious that $a_n$ mod $k$ is periodic?
Let $p(n,m)$ be the number of partitions of the integer $n$ into exactly $m$ parts. Consider the sequence $a_n = p(n,m)$. What is known about the sequence $a_n$ mod $k$?
Let $p(n,m)$ be the number of partitions of the integer $n$ into exactly $m$ parts. Consider the sequence $a_n = p(n,m)$. What is known about the sequence $a_n$ mod $k$? In particular, is it known/obvious that $a_n$ mod $k$ is periodic?
Let $p(n,m)$ be the number of partitions of the integer $n$ into exactly $m$ parts. Consider the sequence $a_n = p(n,m)$. What is known about the sequence $a_n$ mod $k$?
