Revision as of 00:16, 7 January 2023 (view source) Peak (talk \| contribs) (→‎{{header\|jq}}: gojq) ← Older edit		Revision as of 00:23, 7 January 2023 (view source) Peak (talk \| contribs) (clarify first para) Newer edit →
Line 3: The [https://mathworld.wolfram.com/PartitionFunctionP.html Partition Function P], ~~often~~is the ~~notated~~function P(n), iswhere n∈ℤ, defined as the number of ~~solutions~~distinct ~~where~~ways ~~n∈ℤ~~in which n can be expressed as the sum of ~~a set of~~non-increasing positive integers. Line 15: The successive numbers in the above equation have the differences:   1, 3, 2, 5, 3, 7, 4, 9, 5, 11, 6, 13, 7, 15, 8 ... This task may be of popular interest because [https://www.youtube.com/channel/UC1_uAIS3r8Vu6JjXWvastJg Mathologer] made the video, [https://www.youtube.com/watch?v=iJ8pnCO0nTY The hardest "What comes next?" (Euler's pentagonal formula)], where he asks the programmers among his viewers to calculate P(666). The video ~~has been~~was viewed more than 100,000 times in the first couple of weeks ~~since~~after its release. In Wolfram Language, this function has been implemented as PartitionsP.

Partition function P: Difference between revisions

Partition function P (view source)