https://github.com/zubayerhimel/fun-gcd

Find the Greatest Common Divisor using Euclidean Algorithm
https://github.com/zubayerhimel/fun-gcd

euclidean-algorithm gcd npm npm-package

Last synced: 2 months ago
JSON representation

Find the Greatest Common Divisor using Euclidean Algorithm

• Host: GitHub
• URL: https://github.com/zubayerhimel/fun-gcd
• Owner: zubayerhimel
• Created: 2020-10-03T15:12:57.000Z (over 3 years ago)
• Default Branch: master
• Last Pushed: 2020-10-03T16:51:43.000Z (over 3 years ago)
• Last Synced: 2024-02-29T16:45:33.556Z (4 months ago)
• Topics: euclidean-algorithm, gcd, npm, npm-package
• Language: JavaScript
• Homepage: https://www.npmjs.com/package/fun-gcd
• Size: 44.9 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Lists

• awesome-micro-npm-packages - fun-gcd - A tiny math library to get gcd of two numbers using Euclidean algorithm (Modules / Math)

README

        
Get **Greatest Common Divisor (GCD)** using Euclidean Algorithm.

**Install**

```

npm i fun-gcd

```

**Usage**

```js

// es5

const eq = require("fun-gcd");

// es6

import eq from "fun-gcd";

console.log(eq.gcdOfTwo(2, 3));

// => 1

console.log(eq.gcdOfTwo(7, 77));

// => 7

```