Factoring code
Support routines
Factoring Methods
- Phi(n) overshoot
- Square root constraints
- Potential Function Methods
- Relation N = (S-A)*(S+B) [Halleck's method]
- Relation N = (Y-X)*(Y+X) [Fermat's method]
- relation N = (Q-2X)*Q [Han's method]
- relation N = (S-2*A)*(S+2*B) for some S between P and Q. [LeRoy's method]
- relation N = (S-A)*(S+A+C) [Bill's method]
- relation N = (S-A)*(S+A+2*D) [Nahaj's method]
- relation N = P*Q [John's method]
- relation 0 = XX-(D*D+2*S*D-R) [Finnish method]
- relation N = 2*Y*P-P*P [Anon's method]
- relation N = P*(P+2X) [Antihan's method]
Go to ...
This page is http://www.cc.utah.edu/~nahaj/factoring/code.html
This page was last modified on November 29th, 1999