Computes the greatest common divisor (gcd).

Compute the greatest common divisor (gcd).

compute the greatest common divisor using euclid's algorithm

Calculates the greatest common divisor of two integers.

compute Greatest Common Divisor (GCD)

Computes the greatest common divisor

Compute the greatest common divisor (gcd) of two single-precision floating-point numbers.

greatest-common-divisor

Compute the greatest common divisor.

Compute the greatest common divisor of safe integers.

Greatest common divisor component

Compute the greatest common divisor using Iterative implementation.

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

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

Euclid's greatest common divisor algorithm as a JavaScript component

function that checks greatest common divisor between two numbers

find the greatest common divisor of two numbers x and y using Euclid's algorithm.

Find the greatest satisfied semver range from an array of ranges.

To calculate the Greatest Common Divisor(GCD) and Least Common Multiple(LCM) of given two numbers.

A function that takes two integers and returns their greatest common divisor