Prime Factorization
- Abnormal Number
- Almost Prime
- Aurifeuillean Factorization
- Baillie-PSW Primality Test
- Beal's Conjecture
- Biprime
- Brent's Factorization Method
- Class Group Factorization Method
- Cofactor
- Composite Number
- Composite Number Problem
- Continued Fraction Factorization Algorithm
- Dickman Function
- Direct Search Factorization
- Distinct Prime Factorization
- Distinct Prime Factors
- Dixon's Factorization Method
- ECM
- Elliptic Curve Factorization Method
- Erdős-Kac Theorem
- Euclid's Principle
- Euclid's Theorems
- Euler's Factorization Method
- Excludent Factorization Method
- Exponent Vector
- Factor
- Factor Base
- Factoring
- Factorization
- Feit-Thompson Conjecture
- Fermat's Algorithm
- Fermat Compositeness Test
- Fermat's Factorization Method
- Fermat's Lesser Theorem
- Fermat's Little Theorem
- Fermat's Little Theorem Converse
- Fundamental Theorem of Arithmetic
- General Number Field Sieve
- Greatest Prime Factor
- Hardy-Ramanujan Theorem
- Jagged Number
- Least Prime Factor
- Legendre's Factorization Method
- Lenstra Elliptic Curve Method
- Lucas's Theorem
- Multiprimality
- Niven's Constant
- Number Field Sieve
- Ordered Factorization
- Pollard Monte Carlo Factorization Method
- Pollard p-1 Factorization Method
- Pollard rho Factorization Method
- Pólya Conjecture
- Pratt Certificate
- Primary
- Prime Cut
- Prime Factor
- Prime Factorization
- Prime Factorization Algorithms
- Prime Signature
- Prime Unit
- Primitive Prime Factor
- Quadratic Sieve
- Rabin-Miller Strong Pseudoprime Test
- Rough Number
- Roundness
- Sphenic Number
- Squarefree Factorization
- Strong Pseudoprime
- Trial Division
- Trial Divisor
- Triprime
- Unique Factorization Theorem
- Unordered Factorization
- Unusual Number
- Valle's Two-Thirds Factorization Method
- Williams p+1 Factorization Method
- Zsigmondy Theorem