Lesson plan
Fermat's factorization method
Fermat's factorization method, named after Pierre de Fermat, is based on the representation of an odd integer as the difference of two squares: : N = a^2 - b^2. That difference is algebraically factorable as (a+b)(a-b) ; if neither factor equals one, it is a proper factorization of N. Every odd number can be represented as such. If N=cd is a factorization of N, then: N = \left(\frac{c+d}{2}\right)^2 - \left(\frac{c-d}{2}\right)^2 . Since N is odd, both c and d are also odd, and hence the two terms in parentheses are integers. In its simplest form, Fermat's method can be even slower than trial division (in the worst case). Nonetheless, combining Fermat's method and trial division can be more efficient than either method alone.
Article summary
Fermat's factorization method, named after Pierre de Fermat, is based on the representation of an odd integer as the difference of two squares: : N = a^2 - b^2. That difference is algebraically factorable as (a+b)(a-b) ; if neither factor equals one, it is a proper factorization of N. Every odd number can be represented as such. If N=cd is a factorization of N, then: N = \left(\frac{c+d}{2}\right)^2 - \left(\frac{c-d}{2}\right)^2 . Since N is odd, both c and d are also odd, and hence the two terms in parentheses are integers. In its simplest form, Fermat's method can be even slower than trial division (in the worst case). Nonetheless, combining Fermat's method and trial division can be more efficient than either method alone.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.