TOPICS
Search

Prime Factorization Algorithms

Explore PrimeFactorizationAlgorithms on MathWorld


Prime factorization algorithms are algorithms that have been devised for determining the prime factors of a given number (a process called prime factorization).

Prime factorization algorithms is a college-level concept that would be first encountered in a number theory course.

Prerequisites

Algorithm: An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point.
Prime Factorization: Prime factorization is the factorization of a number into its constituent primes. Also called prime decomposition.
Prime Number: A prime number is a positive integer that has exactly one positive integer divisor other than 1 (i.e., no factors other than 1 and itself). Prime numbers are often simply called primes.

Classroom Articles on Number Theory (Up to College Level)

  • Congruence
  • Partition
  • Continued Fraction
  • Perfect Number
  • Convergent
  • Prime Counting Function
  • Diophantine Equation
  • Prime Number Theorem
  • Divisor Function
  • Quadratic Reciprocity Theorem
  • Euclidean Algorithm
  • Squarefree
  • Euler-Mascheroni Constant
  • Totient Function
  • Fermat's Last Theorem
  • Transcendental Number
  • Number Theory