Talk:9 billion names of God the integer: Difference between revisions

 

:: Sorry, I didn't mean to get anybody all worked up and start with the name calling.   I meant to say ''isosceles'' triangle, not ''symmetric isosceles''.   I never intended to imply that the values in the triangle were (perfectly?) symmetrical.   The visual comparison with Pascal's triangle was referring to the shape, not the values of the numbers in the triangle, and not also, of course, how the numbers are derived.   Indeed, the task's author chose to show the first ten rows in an isolsceles triangle shape, and I followed (or mimiced) that manner. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:15, 3 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)

 

So all the action takes place in and it is only necessary to solve the green triangle.

 

[[File:My Green Triangle.png]]