{"entities":{"Q7361115":{"pageid":31518884,"ns":120,"title":"Item:Q7361115","lastrevid":105363065,"modified":"2026-10-07T13:34:45Z","type":"item","id":"Q7361115","labels":{"en":{"language":"en","value":"The Partition Function and the Pentagonal Number Theorem"}},"descriptions":{"en":{"language":"en","value":"AFP entry Pentagonal_Number_Theorem"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e4289483be0a8507226178a8191d563e4b195edb","datavalue":{"value":"https://isa-afp.org/entries/Pentagonal_Number_Theorem.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361115$F250B6B6-6316-4594-92FF-E8F31C403597","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"49fc50cfdf076862330da66ae38c5621d6229c3b","datavalue":{"value":{"time":"+2025-04-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361115$6DEE75DD-6DDD-47FE-89A5-67BBCE8616C8","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"85859c7ab42dcb8b36208f2902b7ce0d86423a6f","datavalue":{"value":"Manuel Eberl","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361115$A408A8EA-45BE-4FD6-8A96-5FAA9BE75D04","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"60eb17fd8aec331a972158104e004551e0fb05a5","datavalue":{"value":{"text":"The Partition Function and the Pentagonal Number Theorem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361115$9406C4C0-54BD-4F14-BDEB-AC80F26429AA","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"dcebd919453686dcba6bf3753902e8db686229fb","datavalue":{"value":"The partition function $p(n)$ gives the number of ways to write a non-negative integer $n$ as a sum of positive integers, without taking order into account. This entry uses the Jacobi Triple Product (already available in the AFP) to give a short proof of the Pentagonal Number Theorem , which is the statement that the generating function $F(X) = \\sum_{n\\geq 0} p(n) X^n$ of the partition function satisfies: \\[F(X)^{-1} = \\sum_{k\\in\\mathbb{Z}} (-1)^k X^{k(3k-1)/2} = 1 - x - x^2 + x^5 + x^7 - x^{12} - x^{15} + \\ldots\\] The numbers $g_k = \\frac{1}{2}k(3k-1)$ appearing in the exponents are the generalised pentagonal numbers . As further corollaries of this, an upper bound for $p(n)$ and the recurrence relation \\[p(n) = \\sum_{\\substack{k\\in\\mathbb{Z}\\setminus\\{0\\} \\\\ g_k \\leq n}} (-1)^{k+1} p(n-g_k)\\] are proved. The latter also yields an algorithm to compute the numbers $p(0), \\ldots, p(n)$ simultaneously in time roughly $n^{2 + o(1)}$. This algorithm is implemented and proved correct at the end of this entry using the Imperative-HOL Refinement Framework.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361115$12040DB3-63A7-4E6A-A716-66E19B483DBA","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"d2f3c84fedec6be5b8f59fef93a6a8632cda3e40","datavalue":{"value":{"entity-type":"item","numeric-id":4101884,"id":"Q4101884"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361115$F4408B5B-8F96-4A5D-A4CF-CACE5CF71501","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361115$23EAA438-264A-4032-91A5-8BBBEBE50BE8","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"e141acec1eec5e0310a29e0b921a02663c767036","datavalue":{"value":{"entity-type":"item","numeric-id":7361646,"id":"Q7361646"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361115$00082C23-DFEE-4967-A13D-A23D5F07F281","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"6df1e1600a3acc40d1b0a9c9cf7cbc177462ddf9","datavalue":{"value":{"entity-type":"item","numeric-id":7361373,"id":"Q7361373"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361115$5A307405-6E7F-42F9-AA3A-87EB55A32C6C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"8abf13f6ac778743b812d2b96e5b400a9714604e","datavalue":{"value":{"entity-type":"item","numeric-id":7361144,"id":"Q7361144"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361115$1245E73D-8941-4375-9D7F-0B050D9785B4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"d4e84c2b5200192617c9e7bb82e13626bc99c266","datavalue":{"value":{"entity-type":"item","numeric-id":7361211,"id":"Q7361211"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361115$3D1A9FE6-41A2-4A13-B989-131B79D29639","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"51467ee0a503af56d0e1903e0514853bd73fc1a9","datavalue":{"value":{"entity-type":"item","numeric-id":7360830,"id":"Q7360830"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361115$14C10481-60F9-4011-B687-8AD7DFD45FD6","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361115$0C3E9FEF-CF06-475A-A76B-2EF7925D36EA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The Partition Function and the Pentagonal Number Theorem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_Partition_Function_and_the_Pentagonal_Number_Theorem"}}}}}