Anonymous user
Talk:9 billion names of God the integer: Difference between revisions
Talk:9 billion names of God the integer (view source)
Revision as of 23:35, 2 May 2013
, 11 years ago==generating function for P(n)== clarifying if C's (shown) generating function is Euler's (is it possibly missing a ½ multiplier?) -- ~~~~
(→task clarification: added another thought on "demonstrate". -- ~~~~) |
(==generating function for P(n)== clarifying if C's (shown) generating function is Euler's (is it possibly missing a ½ multiplier?) -- ~~~~) |
||
Line 4:
The 2nd part of the task's requirement states that the ''integer partition function'' ('''IPF''') is the same as the sum of the ''n''-th row of the number triangle (constructed above), and furthermore, this is to be demonstrated. None of the examples (so far) has shown the last line of any of the ''P''(23), ''P''(123), ''P''(1234), and ''P''(12345) for this purpose. Indeed, it's doable, but the last line of the bigger number triangles would be huge. Are the program examples supposed to sum the last row of the number triangle ''and'' verify via calculating the '''IPF''' via formulaic means? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 20:49, 2 May 2013 (UTC)
==generating function for P(n)==
If the formula shown under the '''C''' example is Euler's generating function, is it missing a '''½''' multiplier? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:35, 2 May 2013 (UTC)
| |||