When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Euclidean algorithm - Wikipedia

    en.wikipedia.org/wiki/Euclidean_algorithm

    For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), ... Synonyms for GCD include greatest common factor (GCF), highest common factor ...

  3. Greatest common divisor - Wikipedia

    en.wikipedia.org/wiki/Greatest_common_divisor

    The greatest common divisor (GCD) of integers a and b, at least one of which is nonzero, is the greatest positive integer d such that d is a divisor of both a and b; that is, there are integers e and f such that a = de and b = df, and d is the largest such integer.

  4. 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 ...

  5. Table of divisors - Wikipedia

    en.wikipedia.org/wiki/Table_of_divisors

    d() is the number of positive divisors of n, including 1 and n itself; σ() is the sum of the positive divisors of n, including 1 and n itselfs() is the sum of the proper divisors of n, including 1 but not n itself; that is, s(n) = σ(n) − n

  6. 252 (number) - Wikipedia

    en.wikipedia.org/wiki/252_(number)

    There are 252 points on the surface of a cuboctahedron of radius five in the face-centered cubic lattice, [8] 252 ways of writing the number 4 as a sum of six squares of integers, [9] 252 ways of choosing four squares from a 4×4 chessboard up to reflections and rotations, [10] and 252 ways of placing three pieces on a Connect Four board. [11]

  7. List of conversion factors - Wikipedia

    en.wikipedia.org/wiki/List_of_conversion_factors

    ≡ 1.079 252 8488 × 10 12 m: light-minute ... = 365.2425 d average, calculated from common years (365 d) plus leap years (366 d) on most years divisible by 4. See ...

  8. Refactorable number - Wikipedia

    en.wikipedia.org/wiki/Refactorable_number

    The equation (,) = has solutions only if is a refactorable number, where is the greatest common divisor function. Let T ( x ) {\displaystyle T(x)} be the number of refactorable numbers which are at most x {\displaystyle x} .

  9. Polynomial greatest common divisor - Wikipedia

    en.wikipedia.org/wiki/Polynomial_greatest_common...

    The greatest common divisor is not unique: if d is a GCD of p and q, then the polynomial f is another GCD if and only if there is an invertible element u of F such that = and =. In other words, the GCD is unique up to the multiplication by an invertible constant.