Izzhov
- 120
- 0
I am aware that there are several generator functions for the Partition Function p(n), but does anyone know if a closed form formula exists for this function?
The discussion revolves around the existence of a closed-form formula for the Partition Function p(n). Participants explore definitions of closed-form expressions, the nature of recursive formulas, and the implications of infinite sums in relation to closed forms.
Participants do not reach a consensus on the existence of a closed-form expression for the Partition Function p(n). There are multiple competing views regarding the definitions and implications of closed forms, as well as the nature of the formulas discussed.
Discussions about the definitions of closed-form expressions reveal limitations in understanding and agreement on what constitutes a closed form, particularly regarding the inclusion of infinite sums and recursion.
Izzhov said:"[A closed-form formula is] a single arithmetic formula obtained to simplify an infinite sum in a general formula." -Wikipedia
A closed-form formula is when you take a formula with an infinite sum, such asCRGreathouse said:That doesn't tell me what it is at all. Further, I don't see what closed form formulas have to do with infinite sums.
Izzhov said:A closed-form formula is when you take a formula with an infinite sum, such as
[tex] s = \sum_{k=0}^\infty ar^k[/tex]
and simplify it to an algebraic formula, which in this case would be
[tex] s = \frac{a}{1 - r}[/tex]
(Assuming, in this case, that r < 1.)
Understand?
Kurret said:Couldnt we define a closed formula p(n) over a set of functions (for example the elementary functions, or maybe only the functions f(x)=x, f(x)=c) combined with a certain set of operations (for example ^*/-+) as a formula whose number of terms (functions):
1) is not infinite
2) is not depending on n.
Izzhov said:I go by the Wikipedia definition.