{"entities":{"Q2648387":{"pageid":2659130,"ns":120,"title":"Item:Q2648387","lastrevid":44559657,"modified":"2025-11-23T22:11:22Z","type":"item","id":"Q2648387","labels":{"en":{"language":"en","value":"An elementary proof of the prime-number theorem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3055540"}},"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":"Q2648387$0FD39B84-1B81-4C87-B40D-4B0387806DCD","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1d085196091caac4bfa260f9b4d0de2c14cce324","datavalue":{"value":{"text":"An elementary proof of the prime-number theorem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2648387$3B41D7C3-2465-4510-A245-817D72B84FC1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"62a1ff566e9da1558e7bdb40fb2bd9704fc9fabe","datavalue":{"value":"0036.30604","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2648387$630DC422-3BC4-41A5-A6F4-1E9801CF68FA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"23fb02fe2eec2ce0e5c43be53f4ece929a0619d3","datavalue":{"value":"10.2307/1969455","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2648387$856057DF-62D6-42AF-810A-68427453F049","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"399616c4a0c74cd7f3d3cafd7a1d0fe5bab8309b","datavalue":{"value":{"entity-type":"item","numeric-id":2580698,"id":"Q2580698"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2648387$40988F04-06C0-49E3-8AF6-2673A045FEB0","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"553c7ad508f4615999d4ef926cfdf75d436f510c","datavalue":{"value":{"entity-type":"item","numeric-id":175062,"id":"Q175062"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2648387$69719CDC-9623-46BC-B489-A4DD836D7243","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1debbae4db8080a087cb8ccb8374c0026368f8df","datavalue":{"value":{"time":"+1949-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":"Q2648387$0B8C2F6F-FABE-4C0C-BC41-E1AF9D0C72C3","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"789b136cd6d01be308f1ba1b93bf86d649d6994c","datavalue":{"value":"https://semanticscholar.org/paper/bb8951736053d85ca66e4980662adfb2a4c46b02","type":"string"},"datatype":"url"},"type":"statement","id":"Q2648387$D375D7B1-E478-4FDF-8B96-7DD2AD525CC5","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"30f08f8a8d9cf8ea4776c7900b1c7c25c83d8c50","datavalue":{"value":"Es werden ganz neue elementare Beweise f\u00fcr die folgenden grundlegenden S\u00e4tze der analytischen Zahlentheorie gegeben:    I: Jede prime Restklasse \\(l\\bmod k\\) enth\u00e4lt unendlich viele Primzahlen (Dirichlet).    II: Die Anzahl \\(\\pi(x)\\) der Primzahlen \\(\\leq x\\) ist asymptotisch \\(x/\\log x\\) (Hadamard, de la Vall\u00e9e Poussin).   III: Eine prime Restklasse mod \\(k\\) enth\u00e4lt bis \\(x\\) asymptotisch \\(x/\\varphi(k)\\log x\\) Primzahlen.    Unter Verwendung bekannter elementarer Absch\u00e4tzungen, wie z.B.  \\[ \\vartheta(x)=\\sum_{p\\leq x} \\log p=O(x),\\quad \\sum_{p\\leq x}p^{-1} \\log p=\\log x +O(1), \\]   wird die im Mittelpunkt der Betrachtungen stehende neue Absch\u00e4tzung hergeleitet:   \\[ \\sum_{p\\leq x} \\log^2 p+\\sum_{pq\\leq x} \\log p\\log q=2x\\log x+O(x), \\]   die dann durch mehrfache Anwendung partieller Summation umgeformt wird in   \\[ |\\vartheta(x)-x|=| R(x)|\\leq \\frac 1{\\log x}\\sum_{n\\leq x} \\Bigl| R\\Bigl(\\frac xn\\Bigr)\\Bigr|+O\\Bigl(\\frac{x\\log \\log x}{\\log x}\\Bigr). \\]  Hieraus wird geschlossen: F\u00fcr beliebiges \\(x>e^{K_1/\\delta}\\) enth\u00e4lt das Intervall \\((x,e^{K_1/\\delta}x)\\) stets ein Teilintervall \\((y,e^{\\delta y}\\), in welchem \\(| R(z)<\\delta z\\) liegt. Beide Absch\u00e4tzungen von \\(R(x)\\) ergeben nun zusammen ein Iterationsverfahren, das mit der Feststellung \\(R(x)=o(x)\\) endet. Das ist bereits im wesentlichen der Primzahlsatz II.   Ein modifizierter Beweis ergibt das analoge Resultat f\u00fcr eine prime Restklasse mod \\(k\\). Dabei wird der Fall reeller Charaktere in Anlehnung an Dirichlet behandelt. Durch eine besondere Methode gelingt es, die sonst \u00fcblichen komplexen Charaktere als ,,less elementary'' ganz zu vermeiden.   Der hier vorkommende Begriff ,,elementar'' ist so zu verstehen: Benutzt werden nur rationale Funktionen, abgesehen von \\(e^x\\) und \\(\\log x\\) f\u00fcr reelle Zahlen (im klassischen Weierstra\u00dfschen Sinn).    Den Begriff ,,elementar'' kann man auch in ganz anderer Weise so auslegen, da\u00df eine Aussage finit (konstruktiv) bewiesen werden soll. Wie L. E. J. Brouwer gezeigt hat, mu\u00df man dann auf das Axiom ,,tertium non datur'' der formalistischen Logik verzichten. Referent hat selbst vor einiger Zeit nachgepr\u00fcft, da\u00df man alle bisherigen Beweise f\u00fcr den Primzahlsatz (bzw. Primidealsatz) auf einfache Weise in diesem Sinn modifizieren kann, wie dies im Falle I schon Mertens und Kronecker getan haben (neuerdings auch Zassenhaus).   Dies ist ein gemeinsames Referat f\u00fcr die drei Arbeiten (vgl. Zbl 0036.30603 und Zbl 0036.30605).","type":"string"},"datatype":"string"},"type":"statement","id":"Q2648387$ED3C0F5B-8473-48DD-B54C-1F71C4F98A28","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"80bda0c03600433cbee31c3b78c66fedeb9f9199","datavalue":{"value":"11N05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2648387$9DF57862-ABC3-4A15-B755-B189C03E6375","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8498982feaab0e411e5ee04a65976b1f88fe020e","datavalue":{"value":"3055540","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2648387$328A0C3A-E5B4-41A3-BF79-810ECBBBE5E3","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"552fe2814423ffd29402e6d6155096127199ab69","datavalue":{"value":"elementary proof of the prime number theorem","type":"string"},"datatype":"string"},"type":"statement","id":"Q2648387$F8011E82-7D09-43B0-89EE-54834551E344","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"e78f6c47cc06bff385efd9ad206adf25c72c1326","datavalue":{"value":"Q55886963","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2648387$6F5B3AE3-909A-484F-9348-994E9B8B7669","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":"Q2648387$EA854324-9AA2-4DB9-8DB3-C242D356553B","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"2720cad3046cfa3839e68acc2e68a27618921651","datavalue":{"value":"W2320598163","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2648387$23F6E82F-17BE-4147-8985-D0C3E221D3C3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2648387","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2648387"}}}}}