Search results
61 packages found
Brain Games Hexlet project №1
Brain Games Hexlet project №1
There are 5 games: brain-even, brain-calc, brain-gcd, brain-progression, brain-prime
Get the greatest common devisor of two numbers
A wrapper around gcloud dataset for storing, retrieving and querying entities
Pollard's rho algorithm implemented in Node.js with long arithmetics
This package contain os different cli games. Check if number is even. Provide a calculation result. Find GCD of 2 numbers. Find missed number in progression. Check if number is prime
This package contain os different cli games. Check if number is even. Provide a calculation result. Find GCD of 2 numbers. Find missed number in progression. Check if number is prime
Calculates the greatest common divisor of two integers.
Get the greatest common devisor of two numbers
JS/TS number utilities
- number-slayer
- fp
- number
- utility
- javascript
- typescript
- range
- addCommasToNumber
- zeroPad
- nthRoot
- gcd
- greatest-common-divisor
- lcm
- least-common-multiple
- View more
function that checks greatest common divisor between two numbers
Brain games
Brain Games
compute Greatest Common Divisor (GCD)
Get **Greatest Common Divisor (GCD)** using Euclidean Algorithm.
the call will result the GCD fo two numbers which are passed as parameters in call var gcd=require("publish_test_sakshi_kottawar/gcd"); var ans=gcd.GCD(5,6);
Euclid's greatest common divisor algorithm as a JavaScript component
A function that takes two integers and returns their greatest common divisor