GCD Packages

glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.

Brain Games

Brain Games Hexlet project №1

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

GCD + Euclidean algorithm

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

Get the greatest common devisor of two numbers

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

Mathematical Operation Services

A very useless math package for your complex javascript projects

A JavaScript library that provides a bunch of useful, optimized and often math-related functions

Tugas Digistar Day 1

function that checks greatest common divisor between two numbers

games of the brains

A number is a mathematical object used to count, measure, and label {web}.

A BigInt can represent whole numbers larger than 2⁵³ - 1 {web}.