Fermat's factorization method
GPTKB entity
Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer factorization algorithm
|
| gptkbp:complexity |
sub-exponential
|
| gptkbp:field |
number theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Fermat's factorization method
|
| gptkbp:introducedIn |
17th century
|
| gptkbp:limitation |
inefficient for numbers with factors far apart
|
| gptkbp:method |
algebraic method
|
| gptkbp:namedAfter |
gptkb:Pierre_de_Fermat
|
| gptkbp:purpose |
factorization of odd integers
|
| gptkbp:relatedTo |
gptkb:quadratic_sieve
trial division difference of squares |
| gptkbp:step |
express n as a difference of two squares
factor n as (x+y)(x-y) find x and y such that n = x^2 - y^2 |
| gptkbp:worksBestFor |
numbers with factors close together
|
| gptkbp:bfsParent |
gptkb:Dixon's_factorization_method
gptkb:Olds'_algorithm gptkb:Pollard's_p−1_algorithm gptkb:Shanks's_square_forms_factorization |
| gptkbp:bfsLayer |
8
|