Also known as the difference of squares. It was first used by Fermat and improved by Gauß. Gauss
looked for Integers and satisfying
for various moduli . This allowed the exclusion of many potential factors. This method works best when factors are
of approximately the same size, so it is sometimes better to attempt for some suitably chosen value of .
See also Prime Factorization Algorithms
© 1996-9 Eric W. Weisstein