Factoring Polynomials: the Five Standard Methods
Common factors, grouping, reverse FOIL, the special forms and perfect squares - the five methods, the order to try them in, and what to do when none of them works.
Every page in the KEVOS library tagged factoring. 20 pages.
Common factors, grouping, reverse FOIL, the special forms and perfect squares - the five methods, the order to try them in, and what to do when none of them works.
Factor polynomials using greatest common factors, difference of two squares and basic trinomial patterns, with multiplication checks.
Handbook guide to quadratic equations by factoring, with rules, worked examples, verification, common errors and practical engineering applications.
Solve quadratic equations by arranging them equal to zero, factoring completely and applying the zero-product property.
What computational algebraic number theory actually computes, why the problems are hard, and how the subject's algorithms fit together.
Why proving compositeness is easy, proving primality is harder, and factoring is harder still — and what this asymmetry means in practice.
Shanks's method factoring an integer by finding an ambiguous form in the class group of the corresponding discriminant.
SQUFOF: factoring by finding a square form in the cycle of an indefinite quadratic form, and why it excels for small inputs.
ECM stage one: multiplying a point by a highly smooth scalar to reach the identity in one component.
Pollard's rho method: cycle detection in a pseudorandom sequence, the birthday bound, and Brent's improvement.
Factoring via class groups of quadratic orders, and its place as the conceptual bridge to the elliptic curve method.
Trial division as the first factoring step, its cost, and Lehman's improvement on Fermat's method.
Trial division and wheel factorisation, Fermat's difference of squares method, Lehman's improvement, and the role of these methods as a preprocessing stage.
The p−1 method with its two stages, smoothness assumptions, the p+1 method using Lucas sequences, and the implications for choosing cryptographic primes.
The separation between primality testing and factoring, compositeness tests versus primality proofs, probable primes, pseudoprimes, and how to select a testing strategy.
The SQUFOF algorithm: continued fraction expansion of the square root, square forms, the reverse cycle, multipliers, and why it excels in a narrow but important range.
CFRAC: generating small residues from the continued fraction expansion of the square root, smoothness testing, the linear algebra step, and its historical role as precursor to t…
Lenstra's elliptic curve factoring method: curves modulo a composite, the failed inversion that reveals a factor, stage one and stage two, curve parameterisations, and the role …
The number field sieve: polynomial selection, sieving over two sides, the algebraic factor base and character columns, the square root step in a number field, and the special nu…
The quadratic sieve, sieving by roots of a polynomial, the multiple polynomial variation, large prime variations, and the linear algebra stage.