Calculator Soup^{®}
This calculator will find all of the prime factors of a given integer and present them as 1) a set of all prime factors, 2) as a set of each prime factor raised to the power of its frequency, and 3) showing the work for the current factorization through a Prime Factors Tree.
The n^{th} prime number can be denoted as Prime[n], so Prime[1] = 2, Prime[2] = 3, Prime[3] = 5, Prime[4] = 7, and so on. See 1000 Prime Numbers. When a prime number such as 1409 is entered and cannot be factored, the index Prime[223] = 1409 will be noted in the answer for n ≤ 1000.
Prime factorization or integer factorization of a number is the determination of the set of prime numbers which multiply together to give the original integer. It is also known as prime decomposition.
The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 and 31, ...
Let's say we want to find the prime factors of 100. We start testing all integers to see if and how often they divide 100 and the subsequent resulting quotients evenly. The resulting set of factors will be prime since, for example, when 2 is exhausted, all multiples of 2 will also be exhausted.
The resulting factors are shown as a sequence of multiples 2 x 2 x 5 x 5 or consolidated as powers 2^{2} x 5^{2}.
Using a prime factorization tree to show our work, prime decomposition of 100 looks like this:
100 | ||||
/ \ | ||||
2 | 50 | |||
/ \ | ||||
2 | 25 | |||
/ \ | ||||
5 | 5 |
http://www.mathsisfun.com/prime-factorization.html
http://mathworld.wolfram.com/DirectSearchFactorization.html
http://mathworld.wolfram.com/PrimeFactorizationAlgorithms.html
The Primes Page at http://primes.utm.edu/
Cite this content, page or calculator as:
Furey, Edward "Prime Factorization Calculator" From http://www.CalculatorSoup.com - Online Calculator Resource.