Skip to content

About

Factors integers into prime numbers

Resources

Stars

0 stars

Watchers

1 watching

Forks

Latest commit

 

History

4 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 

Repository files navigation

Prime Factorizer

This is a plain-looking HTML form that can factor integers into prime numbers when submitted and explain how it arrived at the solution.

In the demo, you can enter any integer and find out its prime factorization.

It is provable that all integers greater than 1 (no matter how large) have a unique Prime Factorization. For an example using a small number, the prime factorization of 24 is given by 24 = 23·3.

This JavaScript routine in prime-factorizer.js implements one possible algorithm for finding the prime factorization of an integer.

It is well known that despite the existence of a solution in all cases, factoring integers into primes is not always temporally possible (even for computers) if we are given a large enough integer to factor. The set of integers is limitless, and so it follows that limitless too is the amount of time it can conceivably take for any process to find the prime factors of a sufficiently large integer.

This JavaScript example illustrates the above paragraph in a "fun" way, by making your browser crash if you enter a number that is too large for our JS algorithm to handle.

Try the demo

About

Factors integers into prime numbers

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages