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

    An even number has the prime factor 2. The first: 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24 (sequence A005843 in the OEIS). An odd number does not have the prime ...

  3. Fundamental theorem of arithmetic - Wikipedia

    en.wikipedia.org/wiki/Fundamental_theorem_of...

    In mathematics, the fundamental theorem of arithmetic, also called the unique factorization theorem and prime factorization theorem, states that every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors. [3] [4] [5] For example,

  4. List of prime numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_prime_numbers

    For n ≥ 2, write the prime factorization of n in base 10 and concatenate the factors; iterate until a prime is reached. 2, 3, ... a = 4: 5 (the only prime for a = 4)

  5. Prime number - Wikipedia

    en.wikipedia.org/wiki/Prime_number

    The same prime factor may occur more than once; this example has two copies of the prime factor When a prime occurs multiple times, exponentiation can be used to group together multiple copies of the same prime number: for example, in the second way of writing the product above, 5 2 {\displaystyle 5^{2}} denotes the square or second power of ...

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

  7. Table of Gaussian integer factorizations - Wikipedia

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

    The entry 4+2i = −i(1+i) 2 (2+i), for example, could also be written as 4+2i= (1+i) 2 (1−2i). The entries in the table resolve this ambiguity by the following convention: the factors are primes in the right complex half plane with absolute value of the real part larger than or equal to the absolute value of the imaginary part.

  8. Fermat's theorem on sums of two squares - Wikipedia

    en.wikipedia.org/wiki/Fermat's_theorem_on_sums_of...

    Since the Diophantus identity implies that the product of two integers each of which can be written as the sum of two squares is itself expressible as the sum of two squares, by applying Fermat's theorem to the prime factorization of any positive integer n, we see that if all the prime factors of n congruent to 3 modulo 4 occur to an even ...

  9. Factorization - Wikipedia

    en.wikipedia.org/wiki/Factorization

    For example, 3 × 5 is an integer factorization of 15, and (x – 2)(x + 2) is a polynomial factorization of x 2 – 4. Factorization is not usually considered meaningful within number systems possessing division, such as the real or complex numbers, since any can be trivially written as () (/) whenever is not zero.