{"id":22173131,"url":"https://github.com/knutkirkhorn/gcd","last_synced_at":"2025-07-26T15:31:13.330Z","repository":{"id":57125194,"uuid":"110043336","full_name":"knutkirkhorn/gcd","owner":"knutkirkhorn","description":"🔢 Get the greatest common devisor of two numbers","archived":false,"fork":false,"pushed_at":"2023-03-04T22:46:28.000Z","size":23,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-10-11T10:42:04.936Z","etag":null,"topics":["api","common","devisor","gcd","greatest","greatest-common-divisor","javascript","math","nodejs"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/knutkirkhorn.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2017-11-08T23:41:49.000Z","updated_at":"2021-11-09T19:43:30.000Z","dependencies_parsed_at":"2022-08-31T08:21:03.610Z","dependency_job_id":null,"html_url":"https://github.com/knutkirkhorn/gcd","commit_stats":null,"previous_names":[],"tags_count":6,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/knutkirkhorn%2Fgcd","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/knutkirkhorn%2Fgcd/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/knutkirkhorn%2Fgcd/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/knutkirkhorn%2Fgcd/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/knutkirkhorn","download_url":"https://codeload.github.com/knutkirkhorn/gcd/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":227689954,"owners_count":17804815,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["api","common","devisor","gcd","greatest","greatest-common-divisor","javascript","math","nodejs"],"created_at":"2024-12-02T07:30:35.559Z","updated_at":"2024-12-02T07:31:17.494Z","avatar_url":"https://github.com/knutkirkhorn.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# gcd\n\n\u003e Get the [greatest common devisor](https://en.wikipedia.org/wiki/Greatest_common_divisor) of two numbers\n\n## Installation\n\n```\nnpm install @knutkirkhorn/gcd\n```\n\n## Usage\n\n```js\nimport gcd from '@knutkirkhorn/gcd';\n\nconsole.log(gcd(28, 2));\n// =\u003e 2\n```\n\n## API\n\n### gcd(number1, number2)\n\nReturns the gcd of ```number1``` and ```number2```.\nThe gcd is computed using the [Euclidean algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm).\n\n## Related\n\n- [@knutkirkhorn/gcd-cli](https://github.com/knutkirkhorn/gcd-cli) - CLI for this module\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fknutkirkhorn%2Fgcd","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fknutkirkhorn%2Fgcd","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fknutkirkhorn%2Fgcd/lists"}