{"_id":"lcm","_rev":"13-81cf8200d2b25e8396eec51bdaf62315","name":"lcm","dist-tags":{"latest":"0.0.4"},"versions":{"0.0.1":{"name":"lcm","version":"0.0.1","keywords":["lcm","math","euclidean"],"author":{"url":"https://bit.ly/nickleefly","name":"Xiuyu Li","email":"nickleefly@gmail.com"},"license":"MIT","_id":"lcm@0.0.1","maintainers":[{"name":"nickleefly","email":"nickleefly@gmail.com"}],"homepage":"https://github.com/nickleefly/node-lcm","bugs":{"url":"https://github.com/nickleefly/node-lcm/issues"},"dist":{"shasum":"763cf128b877718d5bfa58f3b254885f77bca68a","tarball":"https://registry.npmjs.org/lcm/-/lcm-0.0.1.tgz","integrity":"sha512-dVY4EyfmwkX4vNJRiuQGSoHplu75JUsTR/2NAyzb514VX2mG04ACIjwBHEw/kRrij1xPKUtYmltRO3eivlBlHw==","signatures":[{"sig":"MEUCIBCKN9JapUtpgR3pj1qiHe1I6LFCu+ePd1CKK0m91F6yAiEA4Qj65POwgooOLkr23jjinspNeRuGNAuC52vwc1W9CIc=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"763cf128b877718d5bfa58f3b254885f77bca68a","scripts":{"test":"tape test/*.js"},"_npmUser":{"name":"nickleefly","email":"nickleefly@gmail.com"},"repository":{"url":"git://github.com/nickleefly/node-lcm.git","type":"git"},"_npmVersion":"1.4.9","description":"compute the least common multiple using Euclidean algorithm","directories":{"test":"test","example":"example"},"dependencies":{"gcd":"^0.0.1"},"devDependencies":{"tape":"^2.13.1"}},"0.0.2":{"name":"lcm","version":"0.0.2","keywords":["lcm","math","euclidean"],"author":{"url":"https://bit.ly/nickleefly","name":"Xiuyu Li","email":"nickleefly@gmail.com"},"license":"MIT","_id":"lcm@0.0.2","maintainers":[{"name":"nickleefly","email":"nickleefly@gmail.com"}],"homepage":"https://github.com/nickleefly/node-lcm","bugs":{"url":"https://github.com/nickleefly/node-lcm/issues"},"dist":{"shasum":"b2aab1c4c0d4c57b86a754b9d4101f6d6f237608","tarball":"https://registry.npmjs.org/lcm/-/lcm-0.0.2.tgz","integrity":"sha512-HyhQyXDsMZVvgOC3PmTLrirTwyb3mXKYdI46If/lYhLaSXAX3GkG4G2BeUioWmeKjYB19UhPWkan/h7Z/UCCbw==","signatures":[{"sig":"MEUCIQDhMPpYJP8kDeqx5bq5NIziLDsSW6ooJpKPLQGDhQOMjgIgRS77YipkdqL77knDegcI7Rthvc2css7mpf/XzRYyJOI=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"b2aab1c4c0d4c57b86a754b9d4101f6d6f237608","scripts":{"test":"tape test/*.js"},"_npmUser":{"name":"nickleefly","email":"nickleefly@gmail.com"},"repository":{"url":"git://github.com/nickleefly/node-lcm.git","type":"git"},"_npmVersion":"1.4.9","description":"compute the least common multiple using Euclidean algorithm","directories":{"test":"test","example":"example"},"dependencies":{"gcd":"^0.0.1"},"devDependencies":{"tape":"^2.13.1"}},"0.0.3":{"name":"lcm","version":"0.0.3","keywords":["lcm","math","euclidean"],"author":{"url":"https://bit.ly/nickleefly","name":"Xiuyu Li","email":"nickleefly@gmail.com"},"license":"MIT","_id":"lcm@0.0.3","maintainers":[{"name":"nickleefly","email":"nickleefly@gmail.com"}],"homepage":"https://github.com/nickleefly/node-lcm","bugs":{"url":"https://github.com/nickleefly/node-lcm/issues"},"dist":{"shasum":"4a3b11ce0363e297010806080ffeca02f77f8280","tarball":"https://registry.npmjs.org/lcm/-/lcm-0.0.3.tgz","integrity":"sha512-TB+ZjoillV6B26Vspf9l2L/vKaRY/4ep3hahcyVkCGFgsTNRUQdc24bQeNFiZeoxH0vr5+7SfNRMQuPHv/1IrQ==","signatures":[{"sig":"MEUCIGDi6THHiTQhwJkOYai48qWZkJkDTIwgRwzGzJS8VhWLAiEAsdatT0eMpXoMYZRtCpSZu4MdEhQuc/ydEAn0lm3p7GA=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"4a3b11ce0363e297010806080ffeca02f77f8280","scripts":{"test":"tape test/*.js"},"_npmUser":{"name":"nickleefly","email":"nickleefly@gmail.com"},"repository":{"url":"git://github.com/nickleefly/node-lcm.git","type":"git"},"_npmVersion":"1.4.9","description":"compute the least common multiple using Euclidean algorithm","directories":{"test":"test","example":"example"},"dependencies":{"gcd":"^0.0.1"},"devDependencies":{"tape":"^2.13.1"}},"0.0.4":{"name":"lcm","version":"0.0.4","description":"compute the least common multiple using Euclidean algorithm","main":"index.js","directories":{"example":"example","test":"test"},"dependencies":{"gcd":"^0.0.1"},"devDependencies":{"tape":"^5.10.2"},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"git://github.com/nickleefly/node-lcm.git"},"keywords":["lcm","math","euclidean"],"author":{"name":"Xiuyu Li","email":"nickleefly@gmail.com","url":"https://bit.ly/nickleefly"},"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/nickleefly/node-lcm/issues"},"homepage":"https://github.com/nickleefly/node-lcm","gitHead":"e051e34a399b3342983a83471b43a5509bb5f4d0","_id":"lcm@0.0.4","_nodeVersion":"26.0.0","_npmVersion":"11.12.1","dist":{"integrity":"sha512-XzJ7uFBdPSrkdMcYeUqxJDQcXII2XCr37/TfHrTmXBUWgSeMnyNlrBOkoXw3pusg+iBqB0JiafHBAv4apaZNJA==","shasum":"7079bb4a280044890e8d5c0aee4b0ca47a18873f","tarball":"https://registry.npmjs.org/lcm/-/lcm-0.0.4.tgz","fileCount":7,"unpackedSize":3440,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEUCIE4V2m0AhUvuIN/t/xmCF05V2BcEI1YwV3N+NZPOGObCAiEA4DYlDM3m0dI8IIL5ql58bsFMHhFUGjDlBDW5Io8e5V8="}]},"_npmUser":{"name":"nickleefly","email":"nickleefly@gmail.com"},"maintainers":[{"name":"nickleefly","email":"nickleefly@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/lcm_0.0.4_1783318405366_0.4411428553846164"},"_hasShrinkwrap":false}},"time":{"created":"2014-05-22T07:36:22.909Z","modified":"2026-07-06T06:13:25.622Z","0.0.1":"2014-05-22T07:36:22.909Z","0.0.2":"2014-05-22T07:40:45.665Z","0.0.3":"2014-05-22T17:28:16.097Z","0.0.4":"2026-07-06T06:13:25.500Z"},"bugs":{"url":"https://github.com/nickleefly/node-lcm/issues"},"author":{"name":"Xiuyu Li","email":"nickleefly@gmail.com","url":"https://bit.ly/nickleefly"},"license":"MIT","homepage":"https://github.com/nickleefly/node-lcm","keywords":["lcm","math","euclidean"],"repository":{"type":"git","url":"git://github.com/nickleefly/node-lcm.git"},"description":"compute the least common multiple using Euclidean algorithm","maintainers":[{"name":"nickleefly","email":"nickleefly@gmail.com"}],"readme":"# lcm\n\nCompute the least common multiple using\n[Euclid's algorithm](http://en.wikipedia.org/wiki/Euclidean_algorithm).\n\n[![Build Status](https://travis-ci.org/nickleefly/node-lcm.svg?branch=master)](https://travis-ci.org/nickleefly/node-lcm)\n\n[![browser support](https://ci.testling.com/nickleefly/node-lcm.png)\n](https://ci.testling.com/nickleefly/node-lcm)\n\n# example\n\n``` js\nvar lcm = require('lcm');\nvar n = lcm(21, 6);\nconsole.log(n);\n```\n\n***\n\n```\n42\n```\n\n# methods\n\n``` js\nvar lcm = require('lcm')\n```\n\n## lcm(a, b)\n\nReturn the least common multiple of the integers `a` and `b` using Euclid's\nalgorithm.\n\n# install\n\nWith [npm](http://npmjs.org) do:\n\n```\nnpm install lcm\n```\n\n# license\n\nMIT\n","readmeFilename":"README.md","users":{"detj":true,"libattery":true,"nickleefly":true}}