Factoring IntegersYou are currentlybrowsing as guest. Click here to log in 

Integer factorisation is the problem of finding a nontrivial factor of a given number. A factor of n is a number that divides n, and nontrivial means neither 1 nor n.
For example, a nontrivial factor of 11111 is 41, whereas trivial factors are 1, 1, 11111 and 11111.
If n is prime then it has no nontrivial factors. There are techniques for identifying nonprimes that do not explicitly exhibit a factor, so the question of finding a factor is interesting.
The RSA public key cryptosystem uses numbers that are hard to factor, and if a way could be found to factor numbers quickly then that would effectively break it.
Last change to this page Full Page history Links to this page 
Edit this page (with sufficient authority) Change password 
Recent changes All pages Search 