{"entities":{"Q1495073":{"pageid":1505813,"ns":120,"title":"Item:Q1495073","lastrevid":67667376,"modified":"2026-04-12T19:14:21Z","type":"item","id":"Q1495073","labels":{"en":{"language":"en","value":"Grundlagen f\u00fcr eine Theorie des Jacobischen Kettenbruchalgorithmus."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2643686"}},"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":"Q1495073$8A03B35D-17C1-4F09-BC13-5A404AAD6F0C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0c4fb473c0c0a75be61f088faa636857a1d215f7","datavalue":{"value":{"text":"Grundlagen f\u00fcr eine Theorie des Jacobischen Kettenbruchalgorithmus.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1495073$333BAF99-C33E-4555-8D56-2420F5450673","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7e1281de57614526efa5ca328fd028d20ad2b57a","datavalue":{"value":"38.0262.01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1495073$AABF5710-3AB8-4053-A86D-100E8E03D8F7","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c24116c108dec74638bc7e04a52014eec781bff3","datavalue":{"value":"10.1007/BF01449880","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1495073$096FF8D3-4284-411F-BA7D-2F4F6A45210B","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"7016073dc3661ad2b8fcf740b72e135f31d59f23","datavalue":{"value":{"entity-type":"item","numeric-id":166142,"id":"Q166142"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1495073$F103CB7D-0617-4D5A-A487-8360940080F6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c64de3eed0de617d7b2b163f8de943d1f06c00c1","datavalue":{"value":{"time":"+1907-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":"Q1495073$2C5FA4A9-E47F-45EF-97FB-EBA2467A241E","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"fea5eb2f9af237228edc761e4a4ac67bf6b2b216","datavalue":{"value":"https://eudml.org/doc/158303","type":"string"},"datatype":"url"},"type":"statement","id":"Q1495073$6BCF0618-F9AC-4E43-AEF7-66DCDD7BAACA","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"11f1ba20abacd5e2fda4df4cf2b06862833bc202","datavalue":{"value":"Schon Jacobi hat versucht, die Lagrangeschen S\u00e4tze \u00fcber periodische Kettenbr\u00fcche und quadratische Irrationalen zu verallgemeinern, d. h. einen allgemeinen Algorithmus zu finden, der, wenn periodisch, eine algebraische Zahl darstellt. Allein erst \\textit{H. Minkowski} hat dieses Problem gel\u00f6st, und zwar auf anderem Wege, als Jacobi versucht hatte [Acta Math. 26, 333--352 (1903; JFM 33.0216.02)].   Der Verf. der vorliegenden Arbeit geht wieder auf die Jacobischen Ans\u00e4tze zur\u00fcck. Er definiert den Jacobischen Algorithmus von \\((n+1)\\) reellen Zahlen \\(x_0,x_1,\\ldots,x_n\\), untersucht die ``St\u00f6rungen'' desselben (d. h. wann derselbe nicht festzusetzen, wegen Unendlichwerdens eines Gliedes) und beweist bei gewissen Annahmen die Konvergenz und Eindeutigkeit des Verfahrens. Die wichtigste Frage, die nun auftritt, ist: wann ist der Algorithmus periodisch? Dieselbe f\u00fchrt auf die ``charakteristische Gleichung'', die eine Gleichung \\((n+1)\\)-ten Grades ist, und der Verf. zeigt, wie dieselbe beschaffen sein mu\u00df, damit der periodische Algorithmus, aus dem sie entspringt, konvergiert.   Bei reiner Periodizit\u00e4t lassen sich dann die Grenzwerte des Algorithmus durch eine ``Hauptwurzel'' der charakteristischen Gleichung rational darstellen. So gelingt es, den Hauptsatz zu beweisen, da\u00df ein periodischer Kettenbruchalgorithmus aus \\(n\\) Zahlen \\(\\alpha_1,\\ldots,\\alpha_n\\) auf eine charakteristische Gleichung f\u00fchrt, deren gr\u00f6\u00dfte positive Wurzel eine algebraische Einheit ist, deren K\u00f6rper \\(\\alpha_1,\\alpha_2,\\ldots,\\alpha_n\\) angeh\u00f6ren m\u00fcssen, da\u00df also aus der Periodizit\u00e4t auch folgt, \\(\\alpha_1-\\alpha_n\\) seien algebraische Zahlen. Die Umkehrung ist aber nicht m\u00f6glich. Nicht jede algebraische Zahl l\u00e4\u00dft sich in einen periodischen Kettenbruchalgorithmus entwickeln. Somit ist das Schlu\u00dfresultat ein negatives.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1495073$1FEAC5AC-A7BF-499C-A5F6-715391208873","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"5648d57cf9b82b961864414b7326649c4d02c6a2","datavalue":{"value":"11J70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1495073$B3AE79CF-49F7-42C3-88B5-656D166C33D2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"223fe586607c60b0738504f3419a7d40d2a118fe","datavalue":{"value":"11A55","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1495073$67D33A49-0F67-45AF-8C8B-DFA5C5A2F54B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"79184adabc0e7a72a539f2027d1ddf7d52a394ea","datavalue":{"value":"2643686","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1495073$32CF8E83-5D84-481B-A6AF-1A6288CA7158","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"c3c1a03b64276e437f7bd7482e6efc72e1a95757","datavalue":{"value":"Q108689474","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1495073$027CB631-07DB-4F56-88D6-0797D3D6405E","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":"Q1495073$067EB85C-E2EB-4A24-A824-3596F01080B1","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"d32e23f83cf002b74066095f4771c67dd7d0039a","datavalue":{"value":"W1998980189","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1495073$73F58ABF-A563-4E28-9853-FCCD87C11CD5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7223d29360ec0280468a43b5f0c5268f3e5d4d9e","datavalue":{"value":{"entity-type":"item","numeric-id":6480894,"id":"Q6480894"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1495073$F829186F-93AD-4871-9512-052EF1856E28","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Grundlagen f\u00fcr eine Theorie des Jacobischen Kettenbruchalgorithmus.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Grundlagen_f%C3%BCr_eine_Theorie_des_Jacobischen_Kettenbruchalgorithmus."}}}}}