{"entities":{"Q2524092":{"pageid":2534835,"ns":120,"title":"Item:Q2524092","lastrevid":44259348,"modified":"2025-11-21T12:03:16Z","type":"item","id":"Q2524092","labels":{"en":{"language":"en","value":"Ein Verfahren zur Primfaktorzerlegung gro\u00dfer Zahlen mit Hilfe bin\u00e4rer quadrati\\-scher Formen"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3235364"}},"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":"Q2524092$C4A86EBD-CF8D-4281-A06A-5087E8B78A3B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7889e1fea5612cad23db0ae1946b36e29e208cf1","datavalue":{"value":{"text":"Ein Verfahren zur Primfaktorzerlegung gro\u00dfer Zahlen mit Hilfe bin\u00e4rer quadrati\\-scher Formen","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2524092$B9F9BF99-F2D4-40DF-A739-E8FFD7CBC503","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8057a7df47d7e21e69e9c420eb5c2f639cbe9714","datavalue":{"value":"0146.04904","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2524092$5126746C-2CEB-4634-BE66-5E36DC7307DC","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e6ca3f421a349d40b57539ed2e36f7b5bdadf0ec","datavalue":{"value":"10.1007/BF02234367","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2524092$0A723E56-8651-4D8F-8064-BFFCE03F0002","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5521cb3fe5591b6c9903d6e4a0f83cabe890250f","datavalue":{"value":{"entity-type":"item","numeric-id":2524091,"id":"Q2524091"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2524092$7A087D33-3467-4416-AD20-6B3031E5E7F3","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"b79ece58f33b59758a066cb6b9ee149bab3a2c9a","datavalue":{"value":{"entity-type":"item","numeric-id":167642,"id":"Q167642"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2524092$50F6A3E2-2EF4-4EE4-A53F-60A057578CAB","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2b29152725e7ee6f2d3e5de688bdeec7acb631ef","datavalue":{"value":{"time":"+1966-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":"Q2524092$2215AF1A-425D-4C4E-8681-B583A80F27B5","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"1db689a4a6793f3bdcac0a6b93345fec03070bc5","datavalue":{"value":"Verf. findet aus zwei Darstellungen \\(m = x_i^2+Ny_i^2\\) \\((i = 1, 2\\); \\(N\\) ein fester numerus idoneus) eine echte Faktorzerlegung von \\(m=m_1 m_2\\). [Bem. des Ref.: Die bei \\textit{E. Trost} [Primzahlen (1953; Zbl 0053.360*), S. 33] f\u00fcr beliebiges \\(N > 0\\) angegebene Methode ist nicht allgemein anwendbar, der Beweis fehlerhaft; Gegenbeispiel nach R. Pacher: \\(1504 = 38^2+15\\cdot 2^2 = 17^2+15\\cdot 9^2]\\).   Verf. bestimmt s\u00e4mtliche Darstellungen, indem er zun\u00e4chst \\(m\\equiv x_q^2 + Ny_q^2\\mod q\\) mit den Primzahlen \\(q = 3, 5, \\ldots, 31\\) l\u00f6st (wie, ist nicht beschrieben) und daraus \\(x, y\\equiv x_q, y_q \\mod q\\) nach dem Lehmerschen Sieb bestimmt, \\(x, y\\) liegt damit \\(\\mod \\prod_qq\\approx 10^{11}\\) fest. Zur Anwendung auf \\(m\\approx 10^{16}\\) (warum nicht \\(m\\approx 10^{22}\\) ?) ist nur noch zu pr\u00fcfen, ob die simultanen L\u00f6sungen, \\(\\mod q\\) auch als nat\u00fcrliche Zahlen L\u00f6sungen sind.   Verf. gewinnt dann aus der Menge aller L\u00f6sungen, falls sie nicht-leer ist,  s\u00e4mtliche Teiler von \\(m\\), insbesondere nat\u00fcrlich auch einen evtl. Primzahlbeweis.   Die Rechenzeit h\u00e4ngt wesentlich von dem leider nicht beschriebenen Siebprogramm ab. Im Universalrechner ist das Programm nach Angabe des Verf. zeitlich noch dem suksessiven Dividieren durch alle Primzahlen bis \\(\\sqrt m\\) unterlegen, sofern diese gespeichert sein k\u00f6nnen. (Nach Ansicht des Ref. gen\u00fcgt die Speicherung bis \\(\\root 4 \\of m\\), wenn noch gen\u00fcgend Platz f\u00fcr ein Primzahlsieb vorhanden ist.)","type":"string"},"datatype":"string"},"type":"statement","id":"Q2524092$6F8F21D1-1909-4604-9269-178E20758145","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"20afa916015e6219375b9937ece6e51d63990b6f","datavalue":{"value":"11Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2524092$0F07BCFC-2F85-4ADA-B9A0-EC605C8AC9D4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"aef402784c03ebfdea121798de8fd3621c429b07","datavalue":{"value":"11E16","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2524092$ADDFC374-19E9-4672-9BD8-5F6C9C2BFF5E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"934fffe87d2c0f8ef541622335ad263bd611137a","datavalue":{"value":"3235364","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2524092$BE997BF7-5D5A-4BDE-AA19-2D8AFC757576","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"45e6e0baf34bfefb068849610790f322e55cf0ec","datavalue":{"value":"factorization into prime factors","type":"string"},"datatype":"string"},"type":"statement","id":"Q2524092$8E4415C2-4DEB-47D4-9E61-6409DF3E54C7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2ba32ad90f346d357238681ac53d0dc9f1338956","datavalue":{"value":"large numbers","type":"string"},"datatype":"string"},"type":"statement","id":"Q2524092$EBC3DAF7-D931-41E8-8ED2-2AC0831481C6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"68d0f5ba2a89f33c68497b85f9106c83c99a051b","datavalue":{"value":"binary quadratic forms","type":"string"},"datatype":"string"},"type":"statement","id":"Q2524092$E574B3C9-BC48-4491-B71F-4757D203459E","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":"Q2524092$851C1ED8-51D9-41AA-8E05-FA6065B75799","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"c38a18d260ba70b5ca02d66de8f786856fdf0d17","datavalue":{"value":{"entity-type":"item","numeric-id":5610449,"id":"Q5610449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2524092$F5963A83-306F-43E8-B653-4BE7C8303023","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"6eab93209172fcba82fd1ef2b8b965f914d9488c","datavalue":{"value":{"entity-type":"item","numeric-id":3252755,"id":"Q3252755"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2524092$E2734300-2C8A-4986-8E0A-57583AB5437D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"06d7312362462aa288eb2f15ff1252d3add82e1d","datavalue":{"value":{"entity-type":"item","numeric-id":5818826,"id":"Q5818826"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2524092$9D903E60-75DC-4E5F-9B5A-80998ECDAAB5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2524092","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2524092"}}}}}