Description Usage Arguments Value References Examples
Fermat's factorization theorem redefines a composite number n as the difference of squares:
n = a^2 - b^2
Which can also be written as:
n = (a + b)(a - b)
1 |
n |
Integer to be factored into product of smaller integers. |
vector of length two containing factors of integers
Barnes, C. (2004). Integer Factorization Algorithms (1st ed.). Corvallis, OR: Department of Physics, Oregon State University. Fermat's factorization method. (2017, January 31). In Wikipedia, The Free Encyclopedia. From https://en.wikipedia.org/w/index.php?title=Fermat
1 2 | fermat_factor(9)
fermat_factor(30)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.