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 02:39, 4 May 2013
, 11 years ago→task clarification: corrected a typo. -- ~~~~
(→task clarification: added comments concerning shape of the output of the triangle. -- ~~~~) |
m (→task clarification: corrected a typo. -- ~~~~) |
||
Line 5:
:More to the point, the <em>algorithm</em> isn't symmetrical; the values are not derived from the two values above. The visual identity with Pascal's triangle is completely vacuous, and the ancestors the algorithm is visiting are, in fact, easier to see with the left-justified form! --[[User:TimToady|TimToady]] ([[User talk:TimToady|talk]]) 02:09, 3 May 2013 (UTC)
:: 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
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)
| |||