Fermat's factorization method: Difference between revisions

Revision as of 12:15, 21 October 2007

Revision as of 13:14, 30 October 2007

Line 75:

<tr><td></td> <td>N mod 16 is</td><td>5</td></tr>

<tr><td></td> <td>so <math>a^2</math> can only be</td><td>9</td></tr>

<tr><td></td> <td>and <math>a</math> must be</td><td>3 or 5 modulo 816</td></tr>

<tr><td>modulo 9:</td> <td>Squares are</td> <td>0, 1, 4, or 7</td> </tr>

<tr><td></td> <td>N mod 9 is</td><td>7</td></tr>