{"entities":{"Q2620183":{"pageid":2630926,"ns":120,"title":"Item:Q2620183","lastrevid":44504514,"modified":"2025-11-23T09:50:08Z","type":"item","id":"Q2620183","labels":{"en":{"language":"en","value":"\u00dcber die Anzahl der Primfaktoren der ganzen Zahlen."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2540098"}},"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":"Q2620183$B415F19C-9424-4281-B04B-DF511D4E29A9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7e880e2bc547b30720c5791917f3d277ffd9f93a","datavalue":{"value":{"text":"\u00dcber die Anzahl der Primfaktoren der ganzen Zahlen.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2620183$C03AA199-32BC-4E1E-8560-A87A9E73C5F9","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"68ccd6530a337e016b6cc98470f8b1802db1950f","datavalue":{"value":"60.0937.02","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2620183$FFDF3DF5-21AB-4B6D-9680-96F94F0074EE","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"eae60a4ef1761ab9a2c91187277eb65def923cc2","datavalue":{"value":{"entity-type":"item","numeric-id":563080,"id":"Q563080"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2620183$C5D1F9E0-BA54-41F0-952E-97C2DE6C139D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0545e869d8296a0b0654ccbe2e3181b7f2652da8","datavalue":{"value":{"time":"+1934-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":"Q2620183$599961D1-BFF3-4603-AB33-DD8F5C1F72F7","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8ef5ce1a846259bca131b1cfff0430702ecb1840","datavalue":{"value":"Verf. gibt f\u00fcr einen \\textit{Hardy-Ramanujans}chen Satz zwei neue Beweise, und zwar einen elementaren Beweis und einen einfachen analytischen Beweis. Ferner gibt er die folgenden Verallgemeinerungen des \\textit{Hardy-Ramanujans}chen Satzes:  1. Es sei \\(\\Phi (n)\\) eine zahlentheoretische Funktion, die nur den folgenden Bedingungen gen\u00fcgt: \\( \\Phi (n) = \\sum _{p_i|n} \\Phi (p_i)\\) (\\(p_i\\) ist Primzahl), \\(\\Phi (p_i) > 0, \\Phi (p_i)\\) bleibt unter einer Schranke f\u00fcr \\(p_i \\rightarrow \\infty, \\lim _{N\\rightarrow \\infty } \\sum _{p_i \\leq N} \\frac {\\Phi (p_i)}{p_i} = + \\infty \\); dann strebt die Anzahl derjenigen Zahlen \\(n \\leq N\\), f\u00fcr welche wenigstens eine der Ungleichungen  \\[  \\Phi (n) > (1 + \\varepsilon ) \\sum _{p_i \\leq N} \\frac {\\Phi (p_i)}{p_i},\\;\\Phi (n) < (1-\\varepsilon ) \\sum _{p_i \\leq N} \\frac {\\Phi (p_i)}{p_i}  \\]  gilt, durch \\(N\\) dividiert, gegen \\(0\\). Im Falle \\(\\Phi (p_i) \\equiv 1\\) geht der Satz in den \\textit{Hardy-Ramanujans}chen \u00fcber.  2. Es sei das ganzzahlige Polynom \\(f(x)\\) vom Grade \\(n\\), und die Anzahl seiner verschiedenen irreduziblen Faktoren sei \\(k\\); dann strebt die Anzahl derjenigen Zahlen der Form \\(f(n)\\) unter \\(N\\), f\u00fcr welche wenigstens eine der Ungleichungen  \\[  U(f(n)) > (1 + \\varepsilon ) k \\log \\log N, \\;U(f(n)) < (1 - \\varepsilon )k \\log \\log N  \\]  erf\u00fcllt ist, durch \\(\\root n \\of {N}\\) dividiert, gegen \\(0\\). \\(U(m)\\) kann die Anzahl aller oder nur der verschiedene Primfaktoren von \\(m\\) bedeuten.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2620183$25CD7485-B43D-4DF2-93AA-77649910C6E9","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"753cbedfe2100651bd4338c6b8ea2a21edd20fd5","datavalue":{"value":"2540098","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2620183$5913AE79-81EA-4254-9F60-208297CFEACE","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":"Q2620183$3D011904-6B1F-4FDF-ADAD-786A5A5B637F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5518481210f73f5e993099b5896e1dd2c80f3c91","datavalue":{"value":{"entity-type":"item","numeric-id":6480432,"id":"Q6480432"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2620183$35931F23-3463-48B1-851E-11822079D7D2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2620183","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2620183"}}}}}