{"entities":{"Q3840152":{"pageid":5870057,"ns":120,"title":"Item:Q3840152","lastrevid":108370805,"modified":"2026-11-06T03:43:08Z","type":"item","id":"Q3840152","labels":{"en":{"language":"en","value":"The complete analysis of the binary Euclidean algorithm"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1186933"}},"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":"Q3840152$D199C170-2573-48DA-8D43-4E9D5784B910","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"90da501f9e7bda2cf46b7d813e36780187606095","datavalue":{"value":"0908.11063","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3840152$47C34320-C97C-474C-8767-5EAE0518A855","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"80d8830f98e135c2e53e44dfbbd0b7d8428d3812","datavalue":{"value":{"entity-type":"item","numeric-id":194748,"id":"Q194748"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3840152$AE9BA93B-DEEA-4430-A192-28E966C673C4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"acf68b992de59fe00fe26e152a21d07d0ce34455","datavalue":{"value":{"time":"+1999-03-07T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q3840152$13BC11B5-93E0-47DB-B21B-C05A56A6ED0B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"256f0b91854e89f411378c0373e07d2f6c095899","datavalue":{"value":"11Y65","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3840152$021F5F64-CA06-4B7C-9791-0A8ED41D86D4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fd716104cf156585f3bce22202c836b7465d3133","datavalue":{"value":"11Y16","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3840152$B156C025-D488-451F-B2AB-21623A05F70A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c8bafe308117db10b10993ed3b6bc2a6505c6492","datavalue":{"value":"1186933","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3840152$E851BC6B-28F0-4306-88E7-EF70CE3FB929","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5f488c1302c14d77364cc29fab3a0c9afc6dee13","datavalue":{"value":"Euclidean algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q3840152$04EDB76D-EA75-438F-8DDF-80AB38BE57B1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c5f8382ba04f9f05f645b4d0e4b9ea28f0619583","datavalue":{"value":"complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q3840152$2BDFEC0C-0DEA-43D5-B756-4EF1C7D3A48D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9ad86bb53b74d37af3a4d36e8a96c2c4376ac4b1","datavalue":{"value":"continued fractions","type":"string"},"datatype":"string"},"type":"statement","id":"Q3840152$D7E129FE-AD98-4D81-A67B-BA6D7AF1E554","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":"Q3840152$FB9ED1A3-4FCD-4ECA-8358-63E533905F4A","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8377cae520c2619f29c3cf93fb647daf13798759","datavalue":{"value":{"entity-type":"item","numeric-id":908058,"id":"Q908058"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d54bb2a172b2da67a7eb41e659d090037e51ce88","datavalue":{"value":{"amount":"+0.8647221326828003","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q3840152$0E9912D3-CBA2-4742-8E74-D641F7095E0A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6d630ce47d32dfdfd165f77dc1d4a1265719cfbb","datavalue":{"value":{"entity-type":"item","numeric-id":4151157,"id":"Q4151157"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ab4bb2abd1dc0898eb52f68593391061d1f856ed","datavalue":{"value":{"amount":"+0.8352181315422058","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q3840152$996A4AE6-197A-440A-8D19-B179E4DAE038","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c297fdf4bf2ac10b9f01b8c00e278c3f455232f8","datavalue":{"value":{"entity-type":"item","numeric-id":1277390,"id":"Q1277390"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4d306cdc99d592c5fbba73c5aa5a8673685feb58","datavalue":{"value":{"amount":"+0.8202090859413147","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q3840152$FCB0E9EA-8AF0-4B30-863C-7B144E48049B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fbf80cd24fdba45621d304a5898c340dc0f692a5","datavalue":{"value":{"entity-type":"item","numeric-id":3033829,"id":"Q3033829"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"9b46c7977e8452c5ed8930c0954f5555138d658d","datavalue":{"value":{"amount":"+0.7888168692588806","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q3840152$037B7130-8606-4890-834A-69D7276B084A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"84e3a8d7afd2803915ddd954023268731000651d","datavalue":{"value":{"entity-type":"item","numeric-id":917305,"id":"Q917305"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c93839795a4f3d5236e6b8af0387847a88b871dd","datavalue":{"value":{"amount":"+0.785467803478241","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q3840152$DC3159D5-C631-4A94-B5C9-A60273C3BD1F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1f2043440e3713a333252d4f8efb3a451c2b34c0","datavalue":{"value":{"text":"The complete analysis of the binary Euclidean algorithm","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3840152$9F39811F-5997-4766-9393-C403390F6AC7","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4422b7ff6354c1d80cb96fa29febae1386564bfe","datavalue":{"value":"10.1007/BFB0054853","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3840152$320CF001-87C3-4178-93AE-404F15BEBBAF","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"915e164a98d580fbc90c5f3ae1e2a68a3741ce4a","datavalue":{"value":"The number of steps of versions of the Euclidean algorithm for integers has been studied often; \\textit{R. Brent} [Algorithms and Complexity, Proc. Symp., Pittsburgh 1976, 321-355 (1976; Zbl 0373.68040)] based his analysis on some unproven but realistic hypotheses. Here, the author provides an unconditional analysis of several parameters of the binary Euclidean algorithm, including the number of steps. For a description of the methods used in the proofs, see [\\textit{P. Flajolet} and \\textit{B. Vall\u00e9e}, Continued fraction algorithms, functional operators, and structure constants, Theor. Comput. Sci. 194, No. 1-2, 1-34 (1998)]. The constants obtained by the author and by Brent agree numerically to more than 40 decimal places, but a proof of equality is still lacking. For the entire collection see [Zbl 0891.00022].","type":"string"},"datatype":"string"},"type":"statement","id":"Q3840152$9AAC33BC-1C05-45D6-9595-B68FAFCACA04","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"085e254972a59e9e276b504160ce06ca9ca46047","datavalue":{"value":{"entity-type":"item","numeric-id":6546632,"id":"Q6546632"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3840152$03D297C9-D291-4139-8EC8-4B179C256D6A","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3840152$5FA032BA-97F2-4AEB-AFE4-7A47E198A329","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The complete analysis of the binary Euclidean algorithm","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_complete_analysis_of_the_binary_Euclidean_algorithm"}}}}}