Fermat's factorization method: Difference between revisions

Revision as of 12:44, 15 June 2006

Revision as of 13:44, 15 June 2006

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^32 - 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''² &equiv; ''b''² (mod ''N''), called a [[congruence of squares]].