{"entities":{"Q7361185":{"pageid":31519094,"ns":120,"title":"Item:Q7361185","lastrevid":105363800,"modified":"2026-10-07T13:35:03Z","type":"item","id":"Q7361185","labels":{"en":{"language":"en","value":"Computing N-th Roots using the Babylonian Method"}},"descriptions":{"en":{"language":"en","value":"AFP entry Sqrt_Babylonian"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"1aaa3e2201951c7192729da9091f992df5143764","datavalue":{"value":"https://isa-afp.org/entries/Sqrt_Babylonian.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361185$24149810-659E-4259-991F-40262668B6C2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"54c3aea5017a2b930b738e94f94c92304e5e4ff2","datavalue":{"value":{"time":"+2013-01-03T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361185$537682F4-6B92-45F3-A015-6F5ADA224767","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"3e961f1f2b2e533bd88ffdbcd178bd2ef2813f73","datavalue":{"value":"Ren\u00e9 Thiemann","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361185$F41AD7FD-A7CF-40A8-BF6A-8C8F09E60756","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ee3c5ee8358eeb4ef1ad16db6b080d92ab527b12","datavalue":{"value":{"text":"Computing N-th Roots using the Babylonian Method","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361185$859E4D4A-125D-4C15-9F3B-022FEBE4B2DA","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"2f25fc8360dfd69a39c62ee7df9885a9b29784e3","datavalue":{"value":"We implement the Babylonian method to compute n-th roots of numbers. We provide precise algorithms for naturals, integers and rationals, and offer an approximation algorithm for square roots over linear ordered fields. Moreover, there are precise algorithms to compute the floor and the ceiling of n-th roots.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361185$B6C5D5A9-DCD6-4C07-AD0B-327FF42E71D2","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"cbc9f0e8c5eec1350694d41649450bfbe5c127b9","datavalue":{"value":{"entity-type":"item","numeric-id":5992935,"id":"Q5992935"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361185$FAFDA4BA-A30E-482E-AC65-47D888D7D8AB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b0aef60bd392ccfb5e82daa98f095917b33d1745","datavalue":{"value":{"entity-type":"item","numeric-id":3183545,"id":"Q3183545"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361185$DBD19C45-86E6-4717-B630-CDB0C8796C97","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361185$6E18F7A7-238A-4495-BA7C-B81B7E6827DC","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"a803d2984d726dbdee2d10a06603e5d06a4c2572","datavalue":{"value":{"entity-type":"item","numeric-id":7361468,"id":"Q7361468"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361185$17DC4466-5166-4A6F-BFDC-347E9FFB8455","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"ef6655bf04dd34fee9f7dc3b2763244f951e30fe","datavalue":{"value":{"entity-type":"item","numeric-id":7360822,"id":"Q7360822"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361185$CD8B3A05-926F-4B37-B61E-0DC1510DAED4","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361185$3CC9E9EE-B4C3-4F0E-A6F3-657B29F30306","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computing N-th Roots using the Babylonian Method","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Computing_N-th_Roots_using_the_Babylonian_Method"}}}}}