The lowest common divisor is a meaningless term, often mistakingly usen when one actually wishes to refer to either
* the
* the
Wikimedia Foundation. 2010.
Lowest common denominator — This article is about mathematics. For computers, see Lowest common denominator (computers). In mathematics, the lowest common denominator or least common denominator (abbreviated LCD) is the least common multiple of the denominators of a set of… … Wikipedia
Greatest common divisor — In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more non zero integers, is the largest positive integer that divides the numbers without a remainder. For … Wikipedia
Least common multiple — In arithmetic and number theory, the least common multiple (also called the lowest common multiple or smallest common multiple) of two integers a and b, usually denoted by LCM(a, b), is the smallest positive integer that is a multiple of both a… … Wikipedia
Greatest common denominator — The greatest common denominator is a meaningless term, sometimes mistakingly used when one actually wishes to refer to either* the lowest common denominator, which is the least common multiple of the denominators of a set of vulgar fractions. *… … Wikipedia
Fraction (mathematics) — A cake with one quarter removed. The remaining three quarters are shown. Dotted lines indicate where the cake may be cut in order to divide it into equal parts. Each quarter of the cake is denoted by the fraction 1/4. A fraction (from Latin:… … Wikipedia
Irreducible fraction — An irreducible fraction (or fraction in lowest terms or reduced form) is a vulgar fraction in which the numerator and denominator are smaller than those in any other equivalent vulgar fraction. It can be shown that a fraction a⁄b is irreducible… … Wikipedia
Bézout's identity — In number theory, Bézout s identity for two integers a, b is an expression where x and y are integers (called Bézout coefficients for (a,b)), such that d is a common divisor of a and b. Bézout s lemma states that such coefficients exist for every … Wikipedia
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Continued fraction — Finite continued fraction, where a0 is an integer, any other ai are positive integers, and n is a non negative integer. In mathematics, a continued fraction is an expression obtained through an iterative process of representing a number as the… … Wikipedia
