{"entities":{"Q1539917":{"pageid":1550657,"ns":120,"title":"Item:Q1539917","lastrevid":72114045,"modified":"2026-04-14T02:44:03Z","type":"item","id":"Q1539917","labels":{"en":{"language":"en","value":"A combination problem."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2696034"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1539917$7AAD724A-CE3B-44A8-8F9D-96FE31E9C2E4","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"789dcbdc0fdd95445fdbad39c82f22cc49a6ec99","datavalue":{"value":{"text":"A combination problem.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1539917$FB90CAC6-1C72-40EC-BB95-74F854B29804","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"22381109a1fd6e4c4c5361881c088af5b14e9a2d","datavalue":{"value":"19.0198.02","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1539917$EDF3A1B9-0101-44CD-BC70-C48B9352955F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e08c1108983cb613ae6563bc95f7d4b812845f04","datavalue":{"value":{"entity-type":"item","numeric-id":1539915,"id":"Q1539915"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1539917$D6E341C0-AC35-4387-A41C-EE562729656D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"4f454f4f3984c0ad526d565fca3e2753344e5f7c","datavalue":{"value":{"entity-type":"item","numeric-id":1536502,"id":"Q1536502"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1539917$B2541C4D-C988-4722-B271-8B533777C422","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4f87ff571a5126166204de58a5c648f32df793e5","datavalue":{"value":{"time":"+1887-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1539917$B29DDCEA-AC2E-49D3-8337-2A748CE5604C","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"d0a4e32923b164da8db91d61bebac79f11deea75","datavalue":{"value":"Der Verfasser l\u00f6st die folgende Aufgabe: Die Anzahl der von den Zahlen \\(1,\\;2,\\;3,\\;\\dots ,\\;n\\) gebildeten Complexionen zu bestimmen, die so beschaffen sind, dass niemals die Differenz zweier neben einander stehenden Zahlen 1 ist. (F\u00fcr \\(n=4\\) hat man z. B. nur die Complexionen 2413 und 3142).  Es wird nachgewiesen, dass, wenn \\(u_{n,k}\\) die Anzahl solcher Complexionen von \\(1, 2, \\dots, n\\) ist, dass niemals von den Zahlen \\(1, 2, \\dots,k\\) zwei auf einander folgende Zahlen neben einander stehen, die folgende Gleichung stattfindet:  \\[ u_{n,k}=u_{n,k-1}-u_{n-1,k-1}-u_{n-1,k-2}. \\]  Infolge dessen hat man  \\[ \\begin{aligned} & u_{nk}=P_n-2(k-1)P_{n-1}+\\left(2(k-2)+2^2\\;\\frac {(k-2)(k-3)} {1.2}\\right) P_{n-2}\\\\ -& (2(k-3)+2^2\\;\\frac {(k-3)(k-4)} {1.2} \\cdot 2+2^3\\;\\frac {(k-3)(k-4)(k-5)} {1.2.3})P_{n-3}\\\\ & \\hdotsfor1\\\\ +& (-1)^{k-1}P_{n+1-k},\\end{aligned} \\]  wo \\(P_n=1.\\,2.\\,\\dots n\\) und der Coefficient von \\(P_{n-\\alpha}\\) gleich dem Coefficienten von \\(x^{k-\\alpha}\\) in der Reihenentwickelung von \\((-1)^{\\alpha}2x(x+1)^{k-\\alpha}(1+2x)^{\\alpha-1}\\) ist.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1539917$B1FDC94C-EAD5-49E8-81CF-1BDC0A7A4E88","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6247f04fad65d359a20e559b3e9499d6219d492e","datavalue":{"value":"05A05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1539917$8270B73E-170C-4E26-8537-2CCA39E7EFEB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d7654d17d2e51a679c286505ea229f8fb1c63dc4","datavalue":{"value":"2696034","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1539917$D0893B75-3782-418C-A4D0-2C13AB1F177A","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1c0d6a54fae0d2d586a541cb766d75b82f0dacc8","datavalue":{"value":"arrangements with no adjacent elements differing by 1","type":"string"},"datatype":"string"},"type":"statement","id":"Q1539917$D3E8D9FA-3897-416E-9DC4-363EE4D0907F","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1539917$1D4B11D8-05B5-4896-B73F-EFFE1F81D6EE","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A combination problem.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_combination_problem."}}}}}