Fermat's factorization method: Difference between revisions

Revision as of 00:10, 16 March 2022

Revision as of 10:03, 16 March 2022

Line 66:

|}

In practice, one wouldn't bother with that last row, until ''b'' is an integer. But observe that if ''N'' had a subroot factor above <math>a-b=47830.1</math>, Fermat's method would have found it already.

Trial division would normally try up to 48,432; but after only four Fermat steps, we need only divide up to 47830, to find a factor or prove primality.