Find a closed form for the generating function for the number of partitions of n into 3 parts.
Find a closed form for the generating function for the number of partitions of n into 3 parts
3
$\begingroup$
combinatorics
-
2Do they have to be distinct parts? Also, don't just transcribe the question like that - then it makes it look like you're commmanding us as if you're our teacher or at least don't have any intention of talking with us. Say, "I have this problem, `problem`, and here are my thoughts." – 2012-02-08