When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Least common multiple - Wikipedia

    en.wikipedia.org/wiki/Least_common_multiple

    For example, 10 is a multiple of 5 because 5 × 2 = 10, so 10 is divisible by 5 and 2. Because 10 is the smallest positive integer that is divisible by both 5 and 2, it is the least common multiple of 5 and 2. By the same principle, 10 is the least common multiple of −5 and −2 as well.

  3. Greatest common divisor - Wikipedia

    en.wikipedia.org/wiki/Greatest_common_divisor

    The elements 2 and 1 + √ −3 are two maximal common divisors (that is, any common divisor which is a multiple of 2 is associated to 2, the same holds for 1 + √ −3, but they are not associated, so there is no greatest common divisor of a and b.

  4. Euclidean algorithm - Wikipedia

    en.wikipedia.org/wiki/Euclidean_algorithm

    The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5) , and the same number 21 is also the GCD of 105 and 252 − 105 = 147 .

  5. Highly composite number - Wikipedia

    en.wikipedia.org/wiki/Highly_composite_number

    Demonstration, with Cuisenaire rods, of the first four highly composite numbers: 1, 2, 4, 6. A highly composite number is a positive integer that has more divisors than all smaller positive integers.

  6. Table of prime factors - Wikipedia

    en.wikipedia.org/wiki/Table_of_prime_factors

    m and n are coprime (also called relatively prime) if gcd(m, n) = 1 (meaning they have no common prime factor). lcm(m, n) (least common multiple of m and n) is the product of all prime factors of m or n (with the largest multiplicity for m or n). gcd(m, n) × lcm(m, n) = m × n. Finding the prime factors is often harder than computing gcd and ...

  7. Lowest common factor - Wikipedia

    en.wikipedia.org/wiki/Lowest_common_factor

    Lowest common factor may refer to the following mathematical terms: Greatest common divisor, also known as the greatest common factor; Least common multiple;

  8. Lowest common denominator - Wikipedia

    en.wikipedia.org/wiki/Lowest_common_denominator

    The lowest common denominator of a set of fractions is the lowest number that is a multiple of all the denominators: their lowest common multiple. The product of the denominators is always a common denominator, as in: + = + =

  9. Coprime integers - Wikipedia

    en.wikipedia.org/wiki/Coprime_integers

    This is equivalent to their greatest common divisor (GCD) being 1. [2] One says also a is prime to b or a is coprime with b. The numbers 8 and 9 are coprime, despite the fact that neither—considered individually—is a prime number, since 1 is their only common divisor. On the other hand, 6 and 9 are not coprime, because they are both ...