{"entities":{"Q7361646":{"pageid":31520477,"ns":120,"title":"Item:Q7361646","lastrevid":105367910,"modified":"2026-10-07T13:37:18Z","type":"item","id":"Q7361646","labels":{"en":{"language":"en","value":"Cardinality of Number Partitions"}},"descriptions":{"en":{"language":"en","value":"AFP entry Card_Number_Partitions"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7596a0476d6422f4ab640ae92bc359042fcb4a71","datavalue":{"value":"https://isa-afp.org/entries/Card_Number_Partitions.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361646$DEE7C836-2E82-4F84-A8F2-61F1DE6545D4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"af8734646d375c9ed0a45a0653e2a13055a52830","datavalue":{"value":{"time":"+2016-01-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361646$2C5D9899-2B66-4084-9BE7-AEBFEF92DEC2","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"f484b014ef1f7e4d6732c5f6cd3b4a37ab17a130","datavalue":{"value":"Lukas Bulwahn","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361646$2330DE86-81E3-43DD-8EDB-7F7EA15A2B97","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e14b7ce60a15da364705ec1db6bdb49b44435c38","datavalue":{"value":{"text":"Cardinality of Number Partitions","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361646$EF529E39-7EDA-43DA-B145-DF21D150F1BB","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8a149388720acf9869ec7b40455f63302d13ebc6","datavalue":{"value":"This entry provides a basic library for number partitions, defines the two-argument partition function through its recurrence relation and relates this partition function to the cardinality of number partitions. The main proof shows that the recursively-defined partition function with arguments n and k equals the cardinality of number partitions of n with exactly k parts. The combinatorial proof follows the proof sketch of Theorem 2.4.1 in Mazur's textbook `Combinatorics: A Guided Tour`. This entry can serve as starting point for various more intrinsic properties about number partitions, the partition function and related recurrence relations.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361646$8B09FD97-50DE-4FE1-8ECC-8CAC30124BA2","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"b236ccc5e1f228df46f6bdac1a6dc9f0d04e8f05","datavalue":{"value":{"entity-type":"item","numeric-id":3649042,"id":"Q3649042"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361646$ECF244F5-AA03-4B50-9FBF-B46ED588B202","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":"Q7361646$18B2021A-CF22-4B06-842B-90C6AD92AE46","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"5634edfbfbc0239093a6d080d47ef70273afec4d","datavalue":{"value":{"entity-type":"item","numeric-id":7360824,"id":"Q7360824"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361646$C01A9AD2-FD74-4A32-BAB1-1175083F8DAA","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":"Q7361646$1A607F3F-35AF-4F4B-8F9F-8E1704B698F2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Cardinality of Number Partitions","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Cardinality_of_Number_Partitions"}}}}}