{"entities":{"Q1483046":{"pageid":1493786,"ns":120,"title":"Item:Q1483046","lastrevid":67625646,"modified":"2026-04-12T19:05:20Z","type":"item","id":"Q1483046","labels":{"en":{"language":"en","value":"Eine Methode zur Bestimmung der Anzahl der Primitivzahlen f\u00fcr einen Primzahlmodul."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2629193"}},"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":"Q1483046$54931128-1B0F-4918-9D77-02A3A34A625E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a0d24526313329efc42b205fd26593f35c3ee156","datavalue":{"value":{"text":"Eine Methode zur Bestimmung der Anzahl der Primitivzahlen f\u00fcr einen Primzahlmodul.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1483046$82D94D98-16E8-48FB-BB02-D7BF6C68CA0B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"04654bb7f01a5c3e3b3fe4e4b7a66226fd14ad1a","datavalue":{"value":"42.0211.01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1483046$813F3BA6-10E2-4BCF-B16A-0E3A177016CC","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"6c9969cca1d18e6605b7ab9e335ec96209cd7c5d","datavalue":{"value":"10.1007/BF01742799","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1483046$85ED6D6B-76CC-4EE1-908D-4445DD4F22C5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"3d3e1e052244c3cb6b51d49593de436d0f9034f1","datavalue":{"value":{"entity-type":"item","numeric-id":559539,"id":"Q559539"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1483046$60ADA710-4348-43B4-BF41-7ECAE2909410","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7c9bbfaaae89e72cb710e0d3014d2c5b94ec669b","datavalue":{"value":{"time":"+1911-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":"Q1483046$09057DA6-DADB-4B91-8A56-FFE8AB19793E","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"377258567f1c6bf138f37a64f7c85dcfa336a404","datavalue":{"value":"\\textit{Hurwitz} hat eine einfache Methode angegeben (F. d. M. 34, 223, 1903), um die Anzahl der Wurzeln einer algebraischen Kongruenz \\(f(x)\\equiv0\\,(\\mod.p)\\) nach dem Primzahlmodul \\(p\\) zu bestimmen. Ist nun \\(p-1=q^\\vartheta r^\\varrho\\dots,\\) so sind alle Nichtprimitivzahlen \\((\\mod.p)\\) Wurzeln der Kongruenz  \\[ \\left(x^\\frac{p-1}q-1\\right)\\left(x^\\frac{p-1}r1\\right)\\cdots\\equiv0\\quad (\\mod.p). \\]  Wendet man obige Methode auf diese Kongruenz an, so findet man \\(p-1-\\varphi(p-1)\\) als Anzahl der Wurzeln. Also gibt es \\(\\varphi(p-1)\\) Primitivzahlen.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1483046$C5A7597D-5040-4401-9004-F129C3ED45C1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d98760759ccf03f1e62c007ce0c363d37f3e995c","datavalue":{"value":"2629193","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1483046$73BB077A-E592-4199-962E-8AABB40ED2EA","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cb49dc8036c0b5279813aa6a9bfa2e36adc1729f","datavalue":{"value":{"entity-type":"item","numeric-id":577228,"id":"Q577228"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1483046$B88D76DA-45BE-472C-9FDE-909ED84F187B","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":"Q1483046$6C212143-D6D7-45A8-BB2C-7C6ED77A5D7E","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"eb76a1a20063eef08c7fc9f5a2828d845acf902f","datavalue":{"value":"https://doi.org/10.1007/bf01742799","type":"string"},"datatype":"url"},"type":"statement","id":"Q1483046$1D9FF720-90E6-4B04-B0EB-BFA9519587A1","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"9e2054c7d81306a639b5887050b497227136d416","datavalue":{"value":"W1981665715","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1483046$17AD4EA9-DF72-4BF1-8A53-F32355E2FF2C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Eine Methode zur Bestimmung der Anzahl der Primitivzahlen f\u00fcr einen Primzahlmodul.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Eine_Methode_zur_Bestimmung_der_Anzahl_der_Primitivzahlen_f%C3%BCr_einen_Primzahlmodul."}}}}}