Factoring IntegersYou are currentlynot logged in Click here to log in |
|
|
For example, a non-trivial factor of 11111 is 41, whereas trivial factors are 1, -1, 11111 and -11111.
If n is a prime number then by definition it has no non-trivial factors. There are techniques for identifying non-primes that do not explicitly exhibit a factor, so the question of finding a non-trivial divisor 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.
(none) | (none) | AGentleIntroductionToNPC TimeComplexity |
||||
(none) | AGentleIntroductionToTimeComplexity | |||||
⇌ |
You are hereFactoringIntegers |
|||||
Divisor Integer PrimeNumber |
||||||
(none) | (none) | ComplexNumber CompositeNumber CountingNumber PrimePair RationalNumber RealNumber WholeNumber |
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 |