extgcd
Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.
Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.
A BigInt can represent whole numbers larger than 2⁵³ - 1.
Mathematics is the classification and study of all possible patterns.
convert to popular formats
A logic game
Gives absolute value.
Gives absolute value.
Euclid's greatest common divisor algorithm as a JavaScript component
Brain games are set of console mini-games.
Get **Greatest Common Divisor (GCD)** using Euclidean Algorithm.
Brain games
games-for-hexlet-project-one
Pollard's rho algorithm in Node.js
Compute the greatest common divisor using Iterative implementation.
Brain Games
Brain Games Hexlet project №1
Integers for JavaScript
Brain Games Hexlet project №1
educational projecton on JS, contains mini-games
glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.