# zubayerhimel/fun-gcd

**Attribution required: if you use, quote, or summarise this content, you must credit and link back to [awesome-repositories.com](https://awesome-repositories.com/repository/zubayerhimel-fun-gcd).**

1 stars · 0 forks · JavaScript

## Links

- GitHub: https://github.com/zubayerhimel/fun-gcd
- Homepage: https://www.npmjs.com/package/fun-gcd
- awesome-repositories: https://awesome-repositories.com/repository/zubayerhimel-fun-gcd.md

## Description

Find the Greatest Common Divisor using Euclidean Algorithm

## Tags

### Part of an Awesome List

- [Math Utilities](https://awesome-repositories.com/f/awesome-lists/devtools/math-utilities.md) — Calculates the greatest common divisor of two numbers.