Gcd Packages

GCD + Euclidean algorithm

Tools used to understand or work with numbers in Node.JS, Javascript and derivatives.

JS/TS number utilities

Pollard's rho algorithm implemented in Node.js with long arithmetics

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);

Get the greatest common devisor of two numbers

Some common functions for modular arithmetic using native JS implementation of BigInt