{"_id":"compute-lcm","_rev":"13-eaabe67fdabd00911c5781623df3e2f9","name":"compute-lcm","description":"Computes the least common multiple (lcm).","dist-tags":{"latest":"1.1.2"},"versions":{"0.0.0":{"name":"compute-lcm","version":"0.0.0","description":"Computes the least common multiple (lcm).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/lcm.git"},"keywords":["compute.io","compute","computation","mathematics","math","least common multiple","lcm","discrete","arithmetic"],"bugs":{"url":"https://github.com/compute-io/lcm/issues"},"dependencies":{"validate.io-integer":"^1.0.2"},"devDependencies":{"chai":"1.x.x","mocha":"1.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"6b77559e9b38e7c32fa19f8ec589f1ac69fbf61a","homepage":"https://github.com/compute-io/lcm","_id":"compute-lcm@0.0.0","_shasum":"4563a0b619049bbb8e293d19ffc6bd8d6c56bdfe","_from":".","_npmVersion":"1.5.0-alpha-1","_npmUser":{"name":"kgryte","email":"kgryte@gmail.com"},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"}],"dist":{"shasum":"4563a0b619049bbb8e293d19ffc6bd8d6c56bdfe","tarball":"https://registry.npmjs.org/compute-lcm/-/compute-lcm-0.0.0.tgz","integrity":"sha512-oo2OGaEDIC10M4PTIxBO+Y8dPzaO6ULymhOfUguHMb4xugvyrinGAU3Oq5z1IRgDxx17tlNkHPfup+m/5UuZ5A==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICBamLbt3jaZeubsi/tRjI+dn2OJSbzZIo2/TvgnUXblAiBNu5CVCXIM4GyiMwK6y5wZICsKs8UluIp74+53VMh2/A=="}]},"directories":{}},"1.0.0":{"name":"compute-lcm","version":"1.0.0","description":"Computes the least common multiple (lcm).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/lcm.git"},"keywords":["compute.io","compute","computation","mathematics","math","least common multiple","lcm","discrete","arithmetic"],"bugs":{"url":"https://github.com/compute-io/lcm/issues"},"dependencies":{"validate.io-integer":"^1.0.2"},"devDependencies":{"chai":"1.x.x","mocha":"1.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"7ac52595b8eb94bee82983aeafab52c52e6b648f","homepage":"https://github.com/compute-io/lcm","_id":"compute-lcm@1.0.0","_shasum":"537abf9f8684d59e8b3cbc0f9885c0588822f588","_from":".","_npmVersion":"1.5.0-alpha-1","_npmUser":{"name":"kgryte","email":"kgryte@gmail.com"},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"}],"dist":{"shasum":"537abf9f8684d59e8b3cbc0f9885c0588822f588","tarball":"https://registry.npmjs.org/compute-lcm/-/compute-lcm-1.0.0.tgz","integrity":"sha512-QIJxLKwMQVm/+7IMRnVhFx3yDqKqHZXgPHe4Ww3u3/mTyqKMCrduufBMCUjHEQEuFtX6tp8yaavka4zcAMnrIA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCICV0XhgZmhP7LjCFDRHeEe1zR1mryJjDoyOYKzmEu1OFAiAx07XRKWB4YmrmcBtFpbwNglNvx+SMWb1W07Kmg7UH1A=="}]},"directories":{}},"1.0.1":{"name":"compute-lcm","version":"1.0.1","description":"Computes the least common multiple (lcm).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/lcm.git"},"keywords":["compute.io","compute","computation","mathematics","math","least common multiple","lowest common multiple","smallest common multiple","lowest common denominator","lcm","lcd","discrete","arithmetic"],"bugs":{"url":"https://github.com/compute-io/lcm/issues"},"dependencies":{"validate.io-integer":"^1.0.2"},"devDependencies":{"chai":"1.x.x","mocha":"1.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"d723e33e5717aeee180b1928e68b382628daead9","homepage":"https://github.com/compute-io/lcm","_id":"compute-lcm@1.0.1","_shasum":"bd391e88999adf14b45e0997afa962b41a15541e","_from":".","_npmVersion":"1.5.0-alpha-1","_npmUser":{"name":"kgryte","email":"kgryte@gmail.com"},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"}],"dist":{"shasum":"bd391e88999adf14b45e0997afa962b41a15541e","tarball":"https://registry.npmjs.org/compute-lcm/-/compute-lcm-1.0.1.tgz","integrity":"sha512-4roAUH23ZfdR+klhAVf7sHK1GzexuzO0q6RtTR9V4D+3B4G4HIrtTE3rQLBB4KlDjVqvt+jxhSjweZT4bS5oCQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCf9Tuh3bEmcq9ZfgFSzHZ+wR5UhjmaKGRdz/NmWuRGhwIgP/Z0BKMwNBb98/gaW9x5cDKuopMiKRgiY3lDqjgxWUc="}]},"directories":{}},"1.1.0":{"name":"compute-lcm","version":"1.1.0","description":"Computes the least common multiple (lcm).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"},{"name":"Philipp Burckhardt","email":"pburckhardt@outlook.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/lcm.git"},"keywords":["compute.io","compute","computation","mathematics","math","least common multiple","lowest common multiple","smallest common multiple","lowest common denominator","lcm","lcd","discrete","arithmetic","array","integer","gcd","euclid"],"bugs":{"url":"https://github.com/compute-io/lcm/issues"},"dependencies":{"compute-gcd":"^1.2.0","validate.io-array":"^1.0.3","validate.io-function":"^1.0.2","validate.io-integer-array":"^1.0.0"},"devDependencies":{"chai":"2.x.x","mocha":"2.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0","jshint":"2.x.x","jshint-stylish":"^1.0.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"ea5a9005a9c0ef6a921ebfe634a9664065870842","homepage":"https://github.com/compute-io/lcm#readme","_id":"compute-lcm@1.1.0","_shasum":"abd96d040b41b0a166f89944b5c8b7c511e21ad5","_from":".","_npmVersion":"2.8.3","_nodeVersion":"0.10.29","_npmUser":{"name":"kgryte","email":"kgryte@gmail.com"},"dist":{"shasum":"abd96d040b41b0a166f89944b5c8b7c511e21ad5","tarball":"https://registry.npmjs.org/compute-lcm/-/compute-lcm-1.1.0.tgz","integrity":"sha512-8h5ZyTEGCjLrFoyu9zvM9t+eQpqoX5dwouOxrQQUxEupAjfMSgStrRVccVNl9Q3W29wKR+YJhfujxTfFxTBmcA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCNfx16Oe6qxMYR7O+H65HmVaQm0qm9bHn07UM3okd2nQIhAPk3/ZFczTLHe0Ow2wh0rsGAatnzDpd02z9g065eTnHR"}]},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"}],"directories":{}},"1.1.1":{"name":"compute-lcm","version":"1.1.1","description":"Computes the least common multiple (lcm).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"},{"name":"Philipp Burckhardt","email":"pburckhardt@outlook.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/lcm.git"},"keywords":["compute.io","compute","computation","mathematics","math","least common multiple","lowest common multiple","smallest common multiple","lowest common denominator","lcm","lcd","discrete","arithmetic","array","integer","gcd","euclid"],"bugs":{"url":"https://github.com/compute-io/lcm/issues"},"dependencies":{"compute-gcd":"^1.2.1","validate.io-array":"^1.0.3","validate.io-function":"^1.0.2","validate.io-integer-array":"^1.0.0"},"devDependencies":{"chai":"2.x.x","mocha":"2.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0","jshint":"2.x.x","jshint-stylish":"^1.0.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"5f2242feee06650e69762cee94b5ffb62dabff66","homepage":"https://github.com/compute-io/lcm#readme","_id":"compute-lcm@1.1.1","_nodeVersion":"12.9.1","_npmVersion":"6.14.9","dist":{"integrity":"sha512-niZMxW6sWrB/Mzt75h1orhR1948XHbRBj4yvR9klP64Q67DMa9vxQ9HLmEk/5Q3Y82mKARH88KXF0ENL9Hv/Lg==","shasum":"f25f5cd3aa33f3ef9807dbd5d1f0bfc31e334d87","tarball":"https://registry.npmjs.org/compute-lcm/-/compute-lcm-1.1.1.tgz","fileCount":4,"unpackedSize":9252,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfwzwBCRA9TVsSAnZWagAAKaUP/iiReQEHcIaopgfpk3UY\n12Ip6Fd2zdxwDVQsSZxuwh30HMJtt3n4d/6nE5HJPF4pGBATpnd8zJSoBTxM\nGr2KHAH/xCpUd/vQySKDS4IRZKqnuwJvDBGbPiecl/nh/gxHl/M/LJSLN64n\nGFaCWaOP9Gab7DSSbS+8uAQYKzL/wpGJEcYVwECo0yc0iV3GH8f4Gihx9mfx\n7fqyLnyGLIqFYVqbBizvvrJFecv3qOfhKvg91Do5ozk0mnZGt61l4gLm1QUJ\nlWsCLt8E9S+12WEjLjiTwSksUU1vYaQouo9mGvuE9a8TusAXwYhzEELKtioy\nHGb1NI+9iAIU7nrO2qQ1PAF1dJFyRJG/VGrq+6wRneMMhGgiTpuxWXh0Kxy9\nPXcuOC6+X4skX2V3v0RJx1FO+4Dj0KiNJx74TdlJZKcHunll6wNfAmJm40mM\nVjKqmFXxWwbVd+dF2ljB6RLVU/M8k8ljRgEO5iBn2weiAYoqk4BsqzDbX5ji\nuKMpZhVlLCiONx0PEHK9yPPPjT9FE2PLaV3i1bm1+2u6SKzqx0rqkbmIpjf+\nalbB9Nyzz5OvA2+s0I7J8aowRhuw2Te5MuaweV+WI2yQuf7GefhhdTMaOO+d\nTxXgFuZePe0acumtTloXZzq72B5PAztIjriPPJJr0mWNkPfe+m6omdjdvo4F\nMTjY\r\n=L5Fr\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCwTTM33fs1Lwf9JWBEtAEjPCm5xQIEburiL61Ia5SXDgIgAtGMRVxVDVbiQaUJ/X9Vn0L5yY9L9Df3lNWh1PjycNM="}]},"_npmUser":{"name":"planeshifter","email":"pgb@andrew.cmu.edu"},"directories":{},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"},{"name":"planeshifter","email":"pgb@andrew.cmu.edu"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/compute-lcm_1.1.1_1606630401063_0.24377483680669898"},"_hasShrinkwrap":false},"1.1.2":{"name":"compute-lcm","version":"1.1.2","description":"Computes the least common multiple (lcm).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"},{"name":"Philipp Burckhardt","email":"pburckhardt@outlook.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/lcm.git"},"keywords":["compute.io","compute","computation","mathematics","math","least common multiple","lowest common multiple","smallest common multiple","lowest common denominator","lcm","lcd","discrete","arithmetic","array","integer","gcd","euclid"],"bugs":{"url":"https://github.com/compute-io/lcm/issues"},"dependencies":{"compute-gcd":"^1.2.1","validate.io-array":"^1.0.3","validate.io-function":"^1.0.2","validate.io-integer-array":"^1.0.0"},"devDependencies":{"chai":"2.x.x","mocha":"2.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0","jshint":"2.x.x","jshint-stylish":"^1.0.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"6866f3fd73ed338b877a3b4dcfd3ae86a93bcdb7","homepage":"https://github.com/compute-io/lcm#readme","_id":"compute-lcm@1.1.2","_nodeVersion":"12.9.1","_npmVersion":"6.14.9","dist":{"integrity":"sha512-OFNPdQAXnQhDSKioX8/XYT6sdUlXwpeMjfd6ApxMJfyZ4GxmLR1xvMERctlYhlHwIiz6CSpBc2+qYKjHGZw4TQ==","shasum":"9107c66b9dca28cefb22b4ab4545caac4034af23","tarball":"https://registry.npmjs.org/compute-lcm/-/compute-lcm-1.1.2.tgz","fileCount":4,"unpackedSize":9252,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfwzxnCRA9TVsSAnZWagAAUEkP/1jMa0goxGqKJ2hP8nrf\neaQh633djWeCdmgw6746M8YIEAVusKL3/gD6DagsQjESMOiSWCbEV/zft3cN\nyKKVH84ZerBnEXV1y6II8yLXpNjEVdzsm9r6W93ZLx30wB/7t+bWUZhYAlMW\nfQpq06oDcuJDSlusFFMsvFZ+pBBjKw08CFGzb0eJVCtech6/ta3vFPMJmquD\nCOf45Suhx/+c/xivCq/8pfpO5Yp/pnV/9g+ipPr6jJW01cxGre0SX/o0kQwj\nolquBl/1q4wO0hr2bd82vISstBp45sc2qY0JNPGtS0d/3zlqyhLdS9v4TFlD\nIvFzBjCJAlF417KgJn2hme1KfW0ShSlor1AU/2C+jFliBjuPYLEp52HomNpv\n8sfFmuRvhaXRL4QkRh8zk3MnrTE85OfrLcBEdKuH2BWNvupJHwruH97C5wzR\n4KRYKqkdXGSvD+WKJ3IUVs+CSZQP/VDsMwT7nYlOUiplaYcdrGHrAxooajOJ\nbhgZY8BtCgzveF/asm2YDoCq1jbkJPJdB47HHjQoMtrvPIwGmoQ9wU5mfW8A\nzToxUyNXoXYHUgeL7QFfuv4NfSnSv+8oVpk5ZupKaNSACV/XMfEV2DikK4Vo\nHH1Y4yRsTFd+7XLTgKt1oL43jha6zNrrySldqNuZQUdUKvNzoRlS5/Z2yBnu\n2Eqb\r\n=y659\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCrznm2I8RlVVQlxiQUG1Hwj/XYGNo1orJcm2XxddhlIgIhANvqquurPu48GNyP5eIVKxMR6ykHb1RVuW2A+mTHHPhO"}]},"_npmUser":{"name":"planeshifter","email":"pgb@andrew.cmu.edu"},"directories":{},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"},{"name":"planeshifter","email":"pgb@andrew.cmu.edu"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/compute-lcm_1.1.2_1606630502618_0.9274317173498752"},"_hasShrinkwrap":false}},"readme":"Least Common Multiple\n===\n[![NPM version][npm-image]][npm-url] [![Build Status][travis-image]][travis-url] [![Coverage Status][coveralls-image]][coveralls-url] [![Dependencies][dependencies-image]][dependencies-url]\n\n> Computes the [least common multiple](http://en.wikipedia.org/wiki/Least_common_multiple) (lcm).\n\n__Note__: the lcm is also known as the __lowest common multiple__ or __smallest common multiple__ and finds common use in calculating the __lowest common denominator__ (lcd).\n\n\n## Installation\n\n``` bash\n$ npm install compute-lcm\n```\n\nFor use in the browser, use [browserify](https://github.com/substack/node-browserify).\n\n\n## Usage\n\n``` javascript\nvar lcm = require( 'compute-lcm' );\n```\n\n\n#### lcm( a, b[, c,...,n] )\n\nComputes the [least common multiple](http://en.wikipedia.org/wiki/Least_common_multiple) (lcm) of two or more `integers`.\n\n``` javascript\nvar val = lcm( 21, 6 );\n// returns 42\n\nvar val = lcm( 21, 6, 126 );\n// returns 126\n```\n\n\n#### lcm( arr[, clbk] )\n\nComputes the [least common multiple](http://en.wikipedia.org/wiki/Least_common_multiple) (lcm) of two or more `integers`.\n\n``` javascript\nvar val = lcm( [21, 6] );\n// returns 42\n\nvar val = lcm( [21, 6, 126] );\n// returns 126\n```\n\nFor object `arrays`, provide an accessor `function` for accessing `array` values.\n\n``` javascript\nvar data = [\n\t['beep', 4],\n\t['boop', 8],\n\t['bap', 12],\n\t['baz', 16]\n];\n\nfunction getValue( d, i ) {\n\treturn d[ 1 ];\n}\n\nvar arr = lcm( arr, getValue );\n// returns 48\n```\n\n## Notes\n\n- If provided a single `integer` argument or an `array` with a length less than `2`, the function returns `null`.\n\n\n## Examples\n\n``` javascript\nvar lcm = require( 'compute-lcm' );\n\n// Compute the lcm of random tuples...\nvar x, y, z, arr, val;\nfor ( var i = 0; i < 100; i++ ) {\n\tx = Math.round( Math.random()*50 );\n\ty = Math.round( Math.random()*50 );\n\tz = Math.round( Math.random()*50 );\n\tarr = [ x, y, z ];\n\tval = lcm( arr );\n\tconsole.log( arr, val );\n}\n```\n\n\nTo run the example code from the top-level application directory,\n\n``` bash\n$ node ./examples/index.js\n```\n\n\n## Tests\n\n### Unit\n\nUnit tests use the [Mocha](http://mochajs.org) test framework with [Chai](http://chaijs.com) assertions. To run the tests, execute the following command in the top-level application directory:\n\n``` bash\n$ make test\n```\n\nAll new feature development should have corresponding unit tests to validate correct functionality.\n\n\n### Test Coverage\n\nThis repository uses [Istanbul](https://github.com/gotwarlost/istanbul) as its code coverage tool. To generate a test coverage report, execute the following command in the top-level application directory:\n\n``` bash\n$ make test-cov\n```\n\nIstanbul creates a `./reports/coverage` directory. To access an HTML version of the report,\n\n``` bash\n$ make view-cov\n```\n\n\n---\n## License\n\n[MIT license](http://opensource.org/licenses/MIT).\n\n\n## Copyright\n\nCopyright &copy; 2014-2015. Athan Reines.\n\n\n[npm-image]: http://img.shields.io/npm/v/compute-lcm.svg\n[npm-url]: https://npmjs.org/package/compute-lcm\n\n[travis-image]: http://img.shields.io/travis/compute-io/lcm/master.svg\n[travis-url]: https://travis-ci.org/compute-io/lcm\n\n[coveralls-image]: https://img.shields.io/coveralls/compute-io/lcm/master.svg\n[coveralls-url]: https://coveralls.io/r/compute-io/lcm?branch=master\n\n[dependencies-image]: http://img.shields.io/david/compute-io/lcm.svg\n[dependencies-url]: https://david-dm.org/compute-io/lcm\n\n[dev-dependencies-image]: http://img.shields.io/david/dev/compute-io/lcm.svg\n[dev-dependencies-url]: https://david-dm.org/dev/compute-io/lcm\n\n[github-issues-image]: http://img.shields.io/github/issues/compute-io/lcm.svg\n[github-issues-url]: https://github.com/compute-io/lcm/issues\n","maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"},{"name":"planeshifter","email":"pgb@andrew.cmu.edu"}],"time":{"modified":"2022-06-13T20:29:50.220Z","created":"2014-11-22T02:49:05.009Z","0.0.0":"2014-11-22T02:49:05.009Z","1.0.0":"2014-11-22T02:49:23.652Z","1.0.1":"2014-11-24T03:36:48.479Z","1.1.0":"2015-05-08T02:16:25.079Z","1.1.1":"2020-11-29T06:13:21.282Z","1.1.2":"2020-11-29T06:15:02.758Z"},"homepage":"https://github.com/compute-io/lcm#readme","keywords":["compute.io","compute","computation","mathematics","math","least common multiple","lowest common multiple","smallest common multiple","lowest common denominator","lcm","lcd","discrete","arithmetic","array","integer","gcd","euclid"],"repository":{"type":"git","url":"git://github.com/compute-io/lcm.git"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"},{"name":"Philipp Burckhardt","email":"pburckhardt@outlook.com"}],"author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"bugs":{"url":"https://github.com/compute-io/lcm/issues"},"readmeFilename":"README.md"}