Integer Factorization
There's a total of 2 articles.
Integer Factorization
math
number theory
integer factorization
divisibility
prime factorization
erathosthenes sieve
prime numbers
Integer factorization is the process of decomposing a composite number into a product of smaller integers, if these integers are restricted to be prime numbers then the process is called prime factorization.
This article covers factorization using trial division and fermat factorization through Pollard's Rho algorithm and using the sieve of eratosthenes.
Prime factors of a factorial
This article describes and implements a solution for the following problem,
given two numbers $n$ and $k$ find the greatest power of $k$