Fermat's factorization method: Difference between revisions

Content deleted Content added
added a way to find the optimal a_max with seiving
mNo edit summary
Line 229:
 
=== Example ===
Using the same <math>N=2345678917</math>, if theres no sieving then you should choose <math>a_{\mathrm{max}}</math> around 55924.69838392813, the reasonable choice <math>a_{\mathrm{max}} = 55000</math> is not that far off from the optimal. If we are seiving modulo 20, then <math>l = \frac{1}{\frac{4}{20}} = 5</math> and you should choose around <math>\sqrt{2345678917}\frac{6}{\sqrt{11}} \approx 87617.1636423325</math>
 
==Multiplier improvement==