Revision as of 20:39, 2 April 2010 edit Neeme Vaino (talk \| contribs) 41 edits →mod 16 optimization ← Previous edit		Revision as of 20:52, 2 April 2010 edit undo Neeme Vaino (talk \| contribs) 41 edits →Mod 16 optimization Next edit →
Line 34: Example in hexadecimal format: <br>Let '''N''' be 1751<sub>16</sub>.<br> The right digit of '''N''' is 1, from table, right digit of '''a''' can only be 1,7,9 or F.<br> √1751<sub>16</sub> = 4E, so we test for '''a''' only 4F, 51, 57 and get result '''a² - N = 57<sub>16</sub><sup>2</sup> - 1751<sub>16</sub>''' as a perfect square. QEF <br><br> Is this better than in the article? Got it clear now? Should this be in the article page?

Talk:Fermat's factorization method: Difference between revisions