Factoring of Integers Rarely Asked Questions (RAQ)
Someday I really need to flesh out explanations of some of the methods,
and fix up example code for more than the potential function methods.
A code library exists that includes support routines
and code for many of the methods.
Terminology used: (N, P, Q, S, R, A, B, C, D...)
- N = P*Q (P less than Q, P prime, and Q possibly prime)
- N = S*S + R (S is between P and Q, Usually the Integer Square Root)
- N = Y*Y - X*X
- N = (S-A)*(S+B)
- C = B-A
- C = 2 * D
Equivalent Functions now have their own page.
Modular constraints now have their own page.
Square Root constraints.
Go to ...
This page is: http://www.cc.utah.edu/~nahaj/factoring/
This page was last modified on November January 12th, 2009