Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://reference.wolfram.com/language/ref/FactorInteger.html below:

FactorInteger—Wolfram Language Documentation

We deliver solutions for the AI era—combining symbolic computation, data-driven insights and deep technology expertise.

• Data & Computational Intelligence
• Model-Based Design
• Algorithm Development
• Wolfram|Alpha for Business
• Blockchain Technology
• Education Technology
• Quantum Computation

WolframConsulting.com

• See Also
  • PrimeNu
  • PrimeOmega
  • IntegerExponent
  • Prime
  • PrimeQ
  • PrimePowerQ
  • SquareFreeQ
  • CoprimeQ
  • Divisors
  • GCD
  • Factor
• Related Guides
  • Number Theoretic Functions
  • Number Theory
  • Prime Numbers
  • Cryptographic Number Theory
  • Algebraic Number Theory
  • Mathematical Functions
  • Integer Functions
  • Cryptography
• Tech Notes
  • Some Mathematical Functions
  • Integer and Number Theoretic Functions
  • Implementation notes: Numerical and Related Functions

FactorInteger[n]

gives a list of the prime factors of the integer n, together with their exponents.

FactorInteger[n,k]

does partial factorization, pulling out at most k distinct factors.

• FactorInteger is also known as prime factorization.
• For a positive number n=p₁^k₁⋯ p_m^k_m with p_i primes, FactorInteger[n] gives a list {{p₁,k₁},…,{p_m,k_m}}.
• For negative numbers, the unit {-1,1} is included in the list of factors.
• FactorInteger also works on rational numbers. The prime factors of the denominator are given with negative exponents.
• FactorInteger[n,GaussianIntegers->True] factors over Gaussian integers.
• FactorInteger[m+I n] automatically works over Gaussian integers.
• When necessary, a unit of the form {-1,1}, {I,1} or {-I,1} is included in the list of factors.
• The last element in the list FactorInteger[n,k] gives what is left after the partial factorization.
• FactorInteger[n,Automatic] pulls out only factors that are easy to find.
• FactorInteger uses PrimeQ to determine whether factors are prime.

Find prime factors of and their exponents:

Plot the number of distinct prime factors of the first 100 numbers:

FactorInteger works over integers:

Rational numbers:

Gaussian integers:

Find a partial factorization:

Compute for large integers:

FactorInteger threads over lists:

Factor a number over integers:

Gaussian integers:

Every positive integer can be represented as a product of prime factors:

A unit factor:

Plot the number of distinct prime factors of numbers up to :

Compare with the number of distinct prime factors over the Gaussian integers:

Display as an explicit product of factors:

Use FactorInteger to test for prime powers:

Use FactorInteger to find all prime divisors of a number:

Use FactorInteger to compute the number of divisors of the number:

Use FactorInteger to recognize powerful numbers, numbers whose prime factors are all repeated:

Find factorizations of numbers of the form :

Find all natural numbers up to 100 that are primes or prime powers:

The highest power of a prime in numbers up to 100:

Find primes that appear in prime factorization of only to the first power:

Use FactorInteger to compute the square-free part of a number:

Visualize the distribution:

The prime factorization of a prime number is itself:

Prime powers:

Composite numbers have at least two prime factors including multiplicities:

Compute the original number from a factorization:

Exponents in the prime factorization of a square-free number are all :

Divisors gives the list of divisors including prime divisors:

PrimeNu gives the number of distinct prime factors:

PrimeOmega gives the number of prime factors counting multiplicities:

Coprime numbers have no prime factors in common:

If the prime factorization of n is given by , then the number of divisors of n is :

Timings can increase rapidly and unpredictably with the size of the input:

FactorInteger at zero:

Introduced in 1988 (1.0) | Updated in 1996 (3.0) ▪ 2003 (5.0) ▪ 2007 (6.0)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4