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

    Ω(n), the prime omega function, is the number of prime factors of n counted with multiplicity (so it is the sum of all prime factor multiplicities). A prime number has Ω( n ) = 1. The first: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37 (sequence A000040 in the OEIS ).

  3. List of prime numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_prime_numbers

    All prime numbers from 31 to 6,469,693,189 for free download. Lists of Primes at the Prime Pages. The Nth Prime Page Nth prime through n=10^12, pi(x) through x=3*10^13, Random primes in same range. Interface to a list of the first 98 million primes (primes less than 2,000,000,000) Weisstein, Eric W. "Prime Number Sequences". MathWorld.

  4. 6174 - Wikipedia

    en.wikipedia.org/wiki/6174

    6174 is a 7-smooth number, i.e. none of its prime factors are greater than 7. 6174 can be written as the sum of the first three powers of 18: 18 3 + 18 2 + 18 1 = 5832 + 324 + 18 = 6174, and coincidentally, 6 + 1 + 7 + 4 = 18. The sum of squares of the prime factors of 6174 is a square: 2 2 + 3 2 + 3 2 + 7 2 + 7 2 + 7 2 = 4 + 9 + 9 + 49 + 49 ...

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

  6. Highly composite number - Wikipedia

    en.wikipedia.org/wiki/Highly_composite_number

    18 12 240: 4,1,1 6 20 13 ... Roughly speaking, for a number to be highly composite it has to have prime factors as small as possible, but not too many of the same.

  7. Integer factorization - Wikipedia

    en.wikipedia.org/wiki/Integer_factorization

    If one of the factors is composite, it can in turn be written as a product of smaller factors, for example 60 = 3 · 20 = 3 · (5 · 4). Continuing this process until every factor is prime is called prime factorization; the result is always unique up to the order of the factors by the prime factorization theorem.

  8. Landau's problems - Wikipedia

    en.wikipedia.org/wiki/Landau's_problems

    Henryk Iwaniec showed that there are infinitely many numbers of the form + with at most two prime factors. [ 26 ] [ 27 ] Ankeny [ 28 ] and Kubilius [ 29 ] proved that, assuming the extended Riemann hypothesis for L -functions on Hecke characters , there are infinitely many primes of the form p = x 2 + y 2 {\displaystyle p=x^{2}+y^{2}} with y ...

  9. Smooth number - Wikipedia

    en.wikipedia.org/wiki/Smooth_number

    For example, 720 (2 4 × 3 2 × 5 1) is 5-smooth but not 5-powersmooth (because there are several prime powers greater than 5, e.g. = and =). It is 16-powersmooth since its greatest prime factor power is 2 4 = 16. The number is also 17-powersmooth, 18-powersmooth, etc.