{"entities":{"Q5893290":{"pageid":7931401,"ns":120,"title":"Item:Q5893290","lastrevid":31987557,"modified":"2024-03-19T20:32:16Z","type":"item","id":"Q5893290","labels":{"en":{"language":"en","value":"On sequences defined by linear recurrence relations."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2555755"}},"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":"Q5893290$ECA7C19A-A716-4FB7-84B8-72704BA3C473","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ad862798042a37fa59f9cd27d68a8c41f37561f5","datavalue":{"value":{"text":"On sequences defined by linear recurrence relations.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5893290$5322711C-2EA2-4E50-9098-D7E4D2593671","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"68b510c92cd0bda79ad836ec03d86410a1aedad7","datavalue":{"value":"57.0184.01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5893290$DF4C4747-3103-43EA-A19E-7FF4DD4C6AF8","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"cec6d66665eec4f9828b5b9fb703edfdc6ebcca9","datavalue":{"value":"10.2307/1989467","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5893290$0DA5A77C-9443-492B-81EB-67AC9072E73D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c2cea5fe20a07633cfe7d54f9869b1585865a730","datavalue":{"value":{"entity-type":"item","numeric-id":572058,"id":"Q572058"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5893290$F5414B1C-ABAB-4B3A-850A-63044689E969","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"df8563a34b35a91e952c14424ba2e926e2255a87","datavalue":{"value":{"entity-type":"item","numeric-id":559399,"id":"Q559399"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5893290$515E7DC8-5E2D-4AE1-B3A0-643B7849A79B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e0130902a9dcdeca58c7452ef77c67f7d7741a88","datavalue":{"value":{"time":"+1931-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":"Q5893290$0A272926-0C35-49FC-9A5D-690A26BCD6AD","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"9e0a5063db6fef35f36b392c9f1e3838fe31e92d","datavalue":{"value":"Es sei die Folge  \\[  u_0, \\;u_1, \\;u_2, \\dots \\tag{1}  \\]  von ganzen rationalen Zahlen definiert durch die Rekursionsgleichung  \\[  u_{n+k} + a_1 u_{n+k-1} + \\cdots + a_k u_n = a \\qquad (n\\geqq 0), \\tag{2}  \\]  worin \\(a, a_1, \\dots, a_k\\) vorgegebene ganze rationale Zahlen sind. Verf. behandelt hier das Problem der Periodizit\u00e4t einer solchen Folge nach einem beliebigen ganzzahligen Modul \\(m\\). Geht man von den Zahlen der Folge (1) zu den Resten nach dem Modul \\(m\\) \u00fcber, so entsteht eine periodische Folge. Unter allen Periodenzahlen gibt es eine kleinste, die notwendig Teiler aller andern Periodenzahlen ist. Die Bestimmung dieser kleinsten Periodenzahl scheint sehr schwierig zu sein.  Als Fundamentalpolynom der Gleichung (2) bezeichnet man das Polynom  \\[  F(x) = x^k + a_1 x^{k-1} + \\cdots + a_k;  \\]  die Bestimmung von Periodenzahlen h\u00e4ngt eng mit der Zerlegung dieses Polynoms  \\[  F(x) \\equiv \\varphi_1(x)^{e_1} \\varphi_2(x)^{e_2} \\dots \\varphi_r(x)^{e_r} \\;(\\text{mod } p) \\tag{3}  \\]  nach einem Primzahlmodul \\(p\\) zusammen.  Zun\u00e4chst wird der Fall eines Primzahlmoduls behandelt. Ist die Zerlegung (3) bekannt, so kann man stets Periodenzahlen angeben; jedoch ist dar\u00fcber nichts ausgemacht, wie man die kleinste finden kann. Der Fall einer Primzahlpotenz kann auf den einfacheren einer Primzahl zur\u00fcckgef\u00fchrt werden, ebenso der Fall einer beliebigen zusammengesetzten Zahl als Modul.","type":"string"},"datatype":"string"},"type":"statement","id":"Q5893290$679E4F9E-9B7B-49A5-ADA8-216C8D8D1B22","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"687f82bc082809cc85bff74bf751189203dd98ee","datavalue":{"value":"2555755","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5893290$3A614F90-FF55-494A-AB0C-113B3443D1D6","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":"Q5893290$885BD832-5E33-4F28-8F4A-738760FB1614","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"724622f94dd71d6866dd9c3435c4576b110f1d23","datavalue":{"value":"https://doi.org/10.2307/1989467","type":"string"},"datatype":"url"},"type":"statement","id":"Q5893290$55BE7FF3-8B86-42E1-9675-A8FBA47E39F0","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"4db54d5275e81a948f6150091566ff6771cfb5a5","datavalue":{"value":"W4254705693","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5893290$6D57F234-0D4B-4AEA-BE55-52EF4428EAA7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5893290","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5893290"}}}}}