{"entities":{"Q563464":{"pageid":565231,"ns":120,"title":"Item:Q563464","lastrevid":62825829,"modified":"2026-04-11T08:38:20Z","type":"item","id":"Q563464","labels":{"en":{"language":"en","value":"An inversive algorithm."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2549405"}},"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":"Q563464$C366ADC2-9435-4DC6-BD5C-2FB18A9B7A3B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"608d5044b0d4f909729029fd4d5f8cd75cc8e120","datavalue":{"value":{"text":"An inversive algorithm.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q563464$E917D1BC-0F1C-401C-BDDB-18898F60DADB","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7c35d02d764d4916b3783a8a9b8f760ca25ca96d","datavalue":{"value":"58.0154.02","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q563464$3878EEBF-665D-4E20-9922-6CC080F67AAB","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"b383b827c278687411acd745c18554f1832bd865","datavalue":{"value":"10.1090/S0002-9904-1932-05496-9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q563464$89606CE4-3449-4B9D-BEB3-FAD8CE81329E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"de70ce1b64faf2f761c09d3aae1f4d0e9e22c2a9","datavalue":{"value":{"entity-type":"item","numeric-id":563252,"id":"Q563252"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q563464$137EF539-E42E-4627-AAD5-87681E03EB14","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"6ed2e50fab8aad72cbb7a906da42ba85b1de079d","datavalue":{"value":{"entity-type":"item","numeric-id":559421,"id":"Q559421"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q563464$B9C9E938-E603-4C98-988E-6EBB47C6A799","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7bbb53abe68aac0eeb25dacc2ea1a7274c90a69a","datavalue":{"value":{"time":"+1932-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":"Q563464$1DCCDC5B-4641-44CC-83DB-B60B7278F06F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8a569851ed5e1a7893e78775e80e6fdfaadcdc86","datavalue":{"value":"Verf. gibt eine Verallgemeinerung eines von \\textit{Brun} (1931; JFM 57.0185.*) herr\u00fchrenden Algorithmus zur Berechnung der \\(n\\)-ten Primzahl aus der Funktion \\(\\pi (x)\\), welche die Anzahl der Primzahlen unterhalb \\(x\\) angibt. Sei n\u00e4mlich \\(C\\) irgendeine Menge ganzer Zahlen, \\(\\vartheta (x)\\) die zugeh\u00f6rige Anzahlfunktion, welche angibt, wieviel Zahlen von \\(C\\leqq x\\) sind; um die \\(n\\)-te Zahl von \\(C\\) zu bestimmen, bilde man der Reihe nach:  \\[ \\begin{aligned} n_0 &=n,\\\\ n_1 &=n-\\vartheta (n_0),\\\\ n_2 &= n-\\vartheta (n_0+n_1),\\\\ \\cdots &\\cdots \\cdots \\cdots \\cdots \\cdots \\end{aligned}  \\]  Die \\(n_0, n_1, n_2,\\ldots \\) bilden eine monoton nicht zunehmende Folge, welche von einem Glied an lauter Nullen enth\u00e4lt. Ist \\(n_{k-1}\\) das letzte von 0 verschiedene Glied dieser Folge, so ist \\(n_0+n_1+\\cdots +n_{k-1}\\) die gesuchte \\(n\\)-te Zahl der Folge \\(C\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q563464$209B6079-FB55-473D-BD8E-542FF814D00B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"45675a38aa6acb1f21d1b5a10193d134ce3fd3f2","datavalue":{"value":"2549405","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q563464$AFE7C01B-2243-40D2-B960-0A9A22A8E88D","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":"Q563464$2F63EB92-C4C5-48CA-9D55-8E1ECAB206FC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An inversive algorithm.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_inversive_algorithm."}}}}}