When I was at the ARML Power Contest, I came upon question 11 which stated: Explain why the number of partitions of into all different parts is given by the coefficient of in the expansion of the product .
The answer explains how, when the product is expanded but like terms are not collected, each different term that is is formed from adding the powers of several terms from the initial semi-factored form.
I was wondering, does anybody know if there's a generating function or regular old function for the total number of partitions a number can be split into? I tried finding one in terms of sigma, then started working on a Python solution, but it doesn't seem like there is. The formulas I used had to do with combinations and even the same kind of logic that is used to determine the number of ways a certain number can be rolled using any number of dice. If an experienced computer scientist can come up with a great Python or Java version, that would be great also.
Thanks,
Tristan Shin
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
For regular partitions, the generating function is (1−x)(1−x2)(1−x3)⋯1. See http://en.wikipedia.org/wiki/Partition%28numbertheory%29
Log in to reply
Thanks! It seems that just a little bit of manipulation can cause wonderful generating functions!