Talk:9 billion names of God the integer: Difference between revisions
Talk:9 billion names of God the integer (view source)
Revision as of 13:12, 3 May 2013
, 11 years ago→task clarification
Line 6:
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)
:The origional task description did not mention the IPF and called for 25 lines of the triangle. The purpose of G(n) is to show that you can generate the nth line of this triangle without having to display all 12345 elements of it. Other formulations are interesting but not solutions to this task. I have added a child task http://rosettacode.org/wiki/9_billion_names_of_God_the_integer/Worship_of_false_idols where I think that these related triangles should be discussed.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:12, 3 May 2013 (UTC)
:Note that http://rosettacode.org/wiki/9_billion_names_of_God_the_integer#Full_Solution does exactly that which you say no example does.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:12, 3 May 2013 (UTC)
==generating function for P(n)==
| |||