{"_id":"gcd","_rev":"14-4db40216ce387c2ca725095c508f0997","name":"gcd","description":"compute the greatest common divisor using euclid's algorithm","dist-tags":{"latest":"0.0.1"},"versions":{"0.0.0":{"name":"gcd","version":"0.0.0","description":"compute the greatest common divisor using euclid's algorithm","main":"index.js","directories":{"example":"example","test":"test"},"devDependencies":{"tap":"~0.3.0"},"scripts":{"test":"tap test/*.js"},"repository":{"type":"git","url":"git://github.com/substack/node-gcd.git"},"homepage":"https://github.com/substack/node-gcd","keywords":["gcd","divisor","math","maths","mathematics","euclid"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"license":"MIT","_id":"gcd@0.0.0","dist":{"shasum":"cbd8098064160b543906952a9861e285d600106f","tarball":"https://registry.npmjs.org/gcd/-/gcd-0.0.0.tgz","integrity":"sha512-Jt1KKXlEVjQKVn3z+LpDkfEqAJGwaDTnkPrvudBrS7J/Z+o+dLyctle+zp1bx3XPA1KYt8B+k0c2bYaRPURIXQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDTLIYZJBImw5W22f2LTsKv15brqoUtD3X2Kg4I3VS+ewIgVJ2O3TemqBK9HWw+ETfOYT0HUxlx0yKa0S1MFq2Q1QM="}]},"maintainers":[{"name":"substack","email":"mail@substack.net"}]},"0.0.1":{"name":"gcd","version":"0.0.1","description":"compute the greatest common divisor using euclid's algorithm","main":"index.js","directories":{"example":"example","test":"test"},"devDependencies":{"tape":"^2.13.1"},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"git://github.com/substack/node-gcd.git"},"homepage":"https://github.com/substack/node-gcd","keywords":["gcd","divisor","math","maths","mathematics","euclid"],"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"license":"MIT","testling":{"files":"test/*.js","browsers":["ie/8..latest","firefox/15","firefox/latest","firefox/nightly","chrome/15","chrome/latest","chrome/canary","opera/12..latest","opera/next","safari/5.1..latest","ipad/6.0..latest","iphone/6.0..latest","android-browser/4.2..latest"]},"bugs":{"url":"https://github.com/substack/node-gcd/issues"},"_id":"gcd@0.0.1","dist":{"shasum":"41e0bb60bcc9245635419860a22544b230ba2f75","tarball":"https://registry.npmjs.org/gcd/-/gcd-0.0.1.tgz","integrity":"sha512-VNx3UEGr+ILJTiMs1+xc5SX1cMgJCrXezKPa003APUWNqQqaF6n25W8VcR7nHN6yRWbvvUTwCpZCFJeWC2kXlw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCA74sioUo8UndS+jcae0igpo1w1ugtv0JXR+A1xwCYPgIhALRTSNQSC9Di3Rd8WHLYmVPawvYcJasU09vcLRgA1F1X"}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"substack","email":"mail@substack.net"},"maintainers":[{"name":"substack","email":"mail@substack.net"}]}},"readme":"# gcd\n\nCompute the greatest common divisor using\n[Euclid's algorithm](https://en.wikipedia.org/wiki/Greatest_common_divisor#Using_Euclid.27s_algorithm).\n\n[![testling badge](https://ci.testling.com/substack/node-gcd.png)](https://ci.testling.com/substack/node-gcd)\n\n[![build status](https://secure.travis-ci.org/substack/node-gcd.png)](http://travis-ci.org/substack/node-gcd)\n\n# example\n\n``` js\nvar gcd = require('gcd');\nvar n = gcd(121,44);\nconsole.log(n);\n```\n\n***\n\n```\n11\n```\n\n# methods\n\n``` js\nvar gcd = require('gcd')\n```\n\n## gcd(a, b)\n\nReturn the greatest common divisor of the integers `a` and `b` using Euclid's\nalgorithm.\n\n# install\n\nWith [npm](http://npmjs.org) do:\n\n```\nnpm install gcd\n```\n\n# license\n\nMIT\n","maintainers":[{"email":"nopersonsmodules@gmail.com","name":"nopersonsmodules"}],"time":{"modified":"2022-11-11T06:35:07.487Z","created":"2012-08-12T17:40:44.008Z","0.0.0":"2012-08-12T17:40:45.293Z","0.0.1":"2014-05-21T07:53:06.643Z"},"author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"repository":{"type":"git","url":"git://github.com/substack/node-gcd.git"},"users":{"detj":true,"preco21":true,"libattery":true},"homepage":"https://github.com/substack/node-gcd","keywords":["gcd","divisor","math","maths","mathematics","euclid"],"bugs":{"url":"https://github.com/substack/node-gcd/issues"},"license":"MIT","readmeFilename":"readme.markdown"}