Revision as of 04:07, 1 April 2022 edit Ciphergoth (talk \| contribs) Extended confirmed users 4,514 edits →Application: The remarkable success was in 1980 ← Previous edit		Revision as of 11:04, 22 June 2022 edit undo 2a02:a45e:6559:1:d0c3:d961:d471:9bde (talk) →Example: factoring {{mvar\|n}} = 10403 = 101 · 103 Next edit →
Line 58: == Example: factoring {{mvar\|n}} = 10403 = 101 · 103 == InThe following table shows numbers produced by the algorithm, starting with <math>x=2</math> and using the polynomial <math>g(x) = (x^2 + 1) \bmod 10403</math>. The third and fourth columns of the table contain additional information not known by the algorithm. They are included to show how the algorithm works.

Pollard's rho algorithm: Difference between revisions