Quantcast
Processing math: 100%

Greatest Common Divisor

vCalc Reviewed
Last modified by
on
Jan 16, 2023, 6:36:39 PM
Created by
on
Apr 27, 2014, 8:38:06 PM
GCD=Euclid's Algorithm(a,b)
Positive Integer a
Positive Integer b
Tags
UUID
e6d3d270-da27-11e2-8e97-bc764e04d25f

The greatest common divisor (GCD) of two positive integers, also known as the greatest common factor (GCF) or highest common factor (HCF) is the largest in the set of common numbers from the factors of the two input integers.  The Euclidean algorithm is a method for computing GCD.   It is named after the Greek mathematician Euclid, who described it in Books VII and X of his Elements.

Scientific Calculator Functions

Basic Math Functions:

Math Constants:

Trigonometry Functions:

Unit Conversions:

Other Math / Science Calculators:


This equation, Greatest Common Divisor, is used in 5 pages
  • Comments
  • Attachments
  • Stats
No comments
This site uses cookies to give you the best, most relevant experience. By continuing to browse the site you are agreeing to our use of cookies.