Content deleted Content added
m robot Adding: fr:Méthode de factorisation de Fermat |
No edit summary |
||
Line 1:
'''[[Fermat]]'s factorization method''' is a representation of an [[even and odd numbers|odd]] [[integer]] as the difference of two squares:
:<math>N = a^2 - b^2.</math>
That difference is [[algebra]]ically factorable as <math>(a+b)(a-b)</math>; if neither factor equals one, it is a proper factorization of ''N''. Put another way, we are looking for ''a'',''b'' such that ''a''<sup>2</sup> ≡ ''b''<sup>2</sup> (mod ''N''), called a [[congruence of squares]].
| |||