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. *sigh*

A code library exists that includes support routines and code for many of the methods.

**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**

- Division free
- Potential Function Methods now have their own page.
- Measurement of
**Phi(N)**over shoot.
Running time proportional to

**2s-p-q** - Equivalent Functions now have their own page.
- Modular constraints now have their own page.
- Slope hunting.
- Window based

- Square Root constraints.
**X*X = D*D + 2*S*D - R**(Halleck)**Y*Y = N + X*X**(Fermat)

This page is: http://www.cc.utah.edu/~nahaj/factoring/

This page was last modified on November January 12th, 2009