{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:npm/%40stdlib/math-base-special-gcd","name":"@stdlib/math-base-special-gcd","description":"Compute the greatest common divisor (gcd).","version":"0.3.2","softwareVersion":"0.3.2","license":"https://spdx.org/licenses/Apache-2.0","codeRepository":"https://github.com/stdlib-js/math-base-special-gcd","issueTracker":"https://github.com/stdlib-js/math-base-special-gcd/issues","url":"https://stdlib.io","keywords":["stdlib","stdmath","math","mathematics","euclid","euclidean","stein","binary gcd","greatest common divisor","greatest common factor","highest common factor","greatest common measure","highest common divisor","gcd","gcf","hcf","gcm","arithmetic","integer"],"programmingLanguage":{"@type":"ComputerLanguage","name":"JavaScript"},"maintainer":[{"@type":"Person","name":"planeshifter"},{"@type":"Person","name":"rreusser"},{"@type":"Person","name":"stdlib-bot"},{"@type":"Person","name":"kgryte"}],"author":[{"@type":"Person","name":"planeshifter"},{"@type":"Person","name":"rreusser"},{"@type":"Person","name":"stdlib-bot"},{"@type":"Person","name":"kgryte"}],"copyrightHolder":[{"@type":"Person","name":"planeshifter"},{"@type":"Person","name":"rreusser"},{"@type":"Person","name":"stdlib-bot"},{"@type":"Person","name":"kgryte"}],"dateCreated":"2021-06-14","dateModified":"2026-02-05","datePublished":"2026-02-05","copyrightYear":2021,"downloadUrl":"https://registry.npmjs.org/@stdlib/math-base-special-gcd/-/math-base-special-gcd-0.3.2.tgz","applicationCategory":"npm","runtimePlatform":"npm","developmentStatus":"active","sameAs":["https://www.npmjs.com/package/@stdlib/math-base-special-gcd"],"funder":[{"@type":"Organization","url":"https://opencollective.com/stdlib"},{"@type":"Organization","url":"https://github.com/sponsors/stdlib-js"},{"@type":"Organization","url":"https://tidelift.com/funding/github/npm/@stdlib/stdlib"}],"https://www.w3.org/ns/activitystreams#likes":1}