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 m ... An even number has the prime factor 2. The first: 2, 4, 6, 8, 10, 12, 14, 16, 18 ...

  3. Tree of primitive Pythagorean triples - Wikipedia

    en.wikipedia.org/wiki/Tree_of_primitive...

    A tree of primitive Pythagorean triples is a mathematical ... If any prime factor were ... These are precisely the inradii of the three children (5, 12, 13 ...

  4. Integer factorization - Wikipedia

    en.wikipedia.org/wiki/Integer_factorization

    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. To factorize a small integer n using mental or pen-and-paper arithmetic, the simplest method is trial division : checking if the number is divisible by prime numbers 2 ...

  5. List of prime numbers - Wikipedia

    en.wikipedia.org/wiki/List_of_prime_numbers

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

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

  7. Smooth number - Wikipedia

    en.wikipedia.org/wiki/Smooth_number

    This definition includes numbers that lack some of the smaller prime factors; for example, both 10 and 12 are 5-smooth, even though they miss out the prime factors 3 and 5, respectively. All 5-smooth numbers are of the form 2 a × 3 b × 5 c , where a , b and c are non-negative integers.

  8. Fermat number - Wikipedia

    en.wikipedia.org/wiki/Fermat_number

    As of 2024, it is known that F n is composite for 5 ≤ n ≤ 32, although of these, complete factorizations of F n are known only for 0 ≤ n ≤ 11, and there are no known prime factors for n = 20 and n = 24. [5] The largest Fermat number known to be composite is F 18233954, and its prime factor 7 × 2 18233956 + 1 was discovered in October 2020.

  9. Composite number - Wikipedia

    en.wikipedia.org/wiki/Composite_number

    If all the prime factors of a number are repeated it is called a powerful number (All perfect powers are powerful numbers). If none of its prime factors are repeated, it is called squarefree. (All prime numbers and 1 are squarefree.) For example, 72 = 2 3 × 3 2, all the prime factors are repeated, so 72 is a powerful number. 42 = 2 × 3 × 7 ...