Talk:9 billion names of God the integer: Difference between revisions
(added a section. -- ~~~~) |
(→task clarification: added another thought on "demonstrate". -- ~~~~) |
||
| Line 2: | Line 2: | ||
I presume from the task requirement that the output is to more-or-less look like the (partial) number triangle shown, that is, a symmetric isosceles triangle in the manner of Pascal's triangle. Producing a left-justified triangle doesn't look or feel right. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 20:35, 2 May 2013 (UTC) |
I presume from the task requirement that the output is to more-or-less look like the (partial) number triangle shown, that is, a symmetric isosceles triangle in the manner of Pascal's triangle. Producing a left-justified triangle doesn't look or feel right. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 20:35, 2 May 2013 (UTC) |
||
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) |
|||
Revision as of 20:49, 2 May 2013
task clarification
I presume from the task requirement that the output is to more-or-less look like the (partial) number triangle shown, that is, a symmetric isosceles triangle in the manner of Pascal's triangle. Producing a left-justified triangle doesn't look or feel right. -- Gerard Schildberger (talk) 20:35, 2 May 2013 (UTC)
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? -- Gerard Schildberger (talk) 20:49, 2 May 2013 (UTC)