Calculate GCD (JavaScript)

Program

x:
y:
gcd(x, y):

Description

This JavaScript program calculates the greatest common divisor (GCD) of the given integers. The numbers must be between 0 and 2⁵³. This program can be useful for simplifying fractions. The algorithm being used is the classic GCD algorithm by Euclid, which is very fast.

The source code is available.

Examples

• gcd(0, 2) = 2.
• gcd(3, 5) = 1.
• gcd(24, 18) = 6.

More info

• Wikipedia: Greatest common divisor
• Wikipedia: Euclidean algorithm
• MathWorld: Greatest Common Divisor

Related

• Calculate prime factorization (JavaScript)
• Calculate divisors (JavaScript)

Sidebar

Recent

	Project Euler solutions
	Full screen clock (JavaScript)
	So you want to be a day trader? Bad idea.
	Optimizing brainfuck compiler
	About
	(more)

Random

	Transcription of o-Hanabatake
	Fast MD5 hash implementation in x86 assembly
	A septillion CPU cycles a year
	(more)