When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Table of prime factors - Wikipedia

    en.wikipedia.org/wiki/Table_of_prime_factors

    The multiplicity of a prime factor p of n is the largest exponent m for which p ... The first: 4, 8, 9, 16, 25, 27, 32, 36, 49, 64 ... (greatest common divisor of m ...

  3. List of prime numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_prime_numbers

    A cluster prime is a prime p such that every even natural number k ≤ p − 3 is the difference of two primes not exceeding p. 3, 5, 7, 11, 13, 17, 19, 23, ... (OEIS: A038134) All odd primes between 3 and 89, inclusive, are cluster primes. The first 10 primes that are not cluster primes are: 2, 97, 127, 149, 191, 211, 223, 227, 229, 251.

  4. 36 (number) - Wikipedia

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

    Since it is possible to find sequences of 36 consecutive integers such that each inner member shares a factor with either the first or the last member, 36 is an ErdÅ‘s–Woods number. [11] The sum of the integers from 1 to 36 is 666 (see number of the beast). 36 is also a Tridecagonal number. [12]

  5. List of largest known primes and probable primes - Wikipedia

    en.wikipedia.org/wiki/List_of_largest_known...

    These numbers have been proved prime by computer with a primality test for their form, ... 36 7×2 18233956 + 1 1 October 2020 5,488,969 37 3×2 18196595 − 1 [27]

  6. Regular number - Wikipedia

    en.wikipedia.org/wiki/Regular_number

    More generally, a k-smooth number is a number whose greatest prime factor is at most k. [3] ... 32, 36, 40, 45, 48 of nearly consecutive regular numbers. ...

  7. Greatest common divisor - Wikipedia

    en.wikipedia.org/wiki/Greatest_common_divisor

    Greatest common divisors can be computed by determining the prime factorizations of the two numbers and comparing factors. For example, to compute gcd(48, 180) , we find the prime factorizations 48 = 2 4 · 3 1 and 180 = 2 2 · 3 2 · 5 1 ; the GCD is then 2 min(4,2) · 3 min(1,2) · 5 min(0,1) = 2 2 · 3 1 · 5 0 = 12 The corresponding LCM is ...

  8. Table of Gaussian integer factorizations - Wikipedia

    en.wikipedia.org/wiki/Table_of_Gaussian_Integer...

    A Gaussian integer is either the zero, one of the four units (±1, ±i), a Gaussian prime or composite.The article is a table of Gaussian Integers x + iy followed either by an explicit factorization or followed by the label (p) if the integer is a Gaussian prime.

  9. Euclidean algorithm - Wikipedia

    en.wikipedia.org/wiki/Euclidean_algorithm

    For example, 6 and 35 factor as 6 = 2 × 3 and 35 = 5 × 7, so they are not prime, but their prime factors are different, so 6 and 35 are coprime, with no common factors other than 1. A 24×60 rectangle is covered with ten 12×12 square tiles, where 12 is the GCD of 24 and 60.