{"entities":{"Q5906618":{"pageid":8019334,"ns":120,"title":"Item:Q5906618","lastrevid":93336089,"modified":"2026-06-05T04:13:50Z","type":"item","id":"Q5906618","labels":{"en":{"language":"en","value":"The number of steps in the Euclidean algorithm"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 701297"}},"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":"Q5906618$67632B4C-DB39-4E2E-A407-EB3C92553E0D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c3353c5d6115da3a75b9e0c2a06a13634d80ad0c","datavalue":{"value":{"text":"The number of steps in the Euclidean algorithm","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5906618$9C85D9F1-5C81-4CEB-AD81-39372FD91517","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"917401e9ee1164d07dfca386fb022b6ccfdf9e4d","datavalue":{"value":"0811.11055","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5906618$DA63C995-4019-4F1E-9503-C915C9B46ADA","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a735c1244db85d8aafaa82efb3a9be10b3039747","datavalue":{"value":{"entity-type":"item","numeric-id":217132,"id":"Q217132"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5906618$C8C1FD5B-A1B2-419B-80E3-B00FC82CEC70","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"e6cac328d206d9ef9b7afb3fb4ca5d1d204199af","datavalue":{"value":{"entity-type":"item","numeric-id":167107,"id":"Q167107"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5906618$41A0BC00-CEAE-4ACF-87D5-621D23BF8BD1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"10b8be3aaae04a8b6e1fb062263f34380fce1ca5","datavalue":{"value":{"time":"+1994-12-11T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5906618$D511E9C2-902A-4101-A14D-2FB83D702C7E","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"bc2c839fd76c5b41e8496dc5ec1728ffbfd1b0ac","datavalue":{"value":"The author deals with the Euclidean algorithm and with related pairs \\((a,b)\\), which by a special selection converge to the normal distribution.","type":"string"},"datatype":"string"},"type":"statement","id":"Q5906618$8F5C6793-0E6E-4DA9-83A0-B45F8407C25A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d85bd8080c61b6e59488355ff592e0c47c617bea","datavalue":{"value":"11K55","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5906618$30786ED5-C9EF-48FF-8961-582AE5D7360F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5f6f2e73ebe360c69b5f99d6be8e06f538650497","datavalue":{"value":"11A05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5906618$5CAB2FDE-E1A3-413A-A223-065324D7193D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b768a87a8140a024b4350a958686035f8ad3ba33","datavalue":{"value":"701297","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5906618$0A7792CB-991D-45A7-8DBB-B00F2DC1E564","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5f488c1302c14d77364cc29fab3a0c9afc6dee13","datavalue":{"value":"Euclidean algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q5906618$B1FC5D68-773E-4763-A1D4-50A552747902","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"575f7548b820ce15db73b9e523ff0fc80ec31f45","datavalue":{"value":"normal distribution","type":"string"},"datatype":"string"},"type":"statement","id":"Q5906618$2B246941-3090-4903-8369-A8F969EBDC8E","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"d73ad5bad752158bd530aae91e6b9fd7d5e79b89","datavalue":{"value":{"entity-type":"item","numeric-id":590009,"id":"Q590009"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5906618$1F7F9ED1-E1DA-41D1-869E-A3F1648D055F","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":"Q5906618$DF1D0DDE-3F0B-4335-9B9A-E864496DE7C1","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"f5ed90bec10afffb154d8ae691c9b2134ef070cc","datavalue":{"value":"https://doi.org/10.1006/jnth.1994.1088","type":"string"},"datatype":"url"},"type":"statement","id":"Q5906618$DBD13D86-166E-4EAB-82C7-5941AEE936BF","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"c5528bb4e6c6af7121140ce287989bfe334e0cc1","datavalue":{"value":"W2065660572","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5906618$E1EDBAA1-9057-4722-AE21-5A0B238BAF6F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8b042579d0b7a108bde596b58c3f85fde93db600","datavalue":{"value":"10.1006/JNTH.1994.1088","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5906618$CCD114F4-2D7F-48F3-AE63-93E44AFAC1A7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The number of steps in the Euclidean algorithm","badges":[]}}}}}