An algorithm for factoring non-monic quadratic polynomials Or: How I learned to stop using the quadratic formula and love undoing FOIL

2009/12/07 by Corey Thomas Bruns, Bruns, Corey Thomas
Computer Science · Mathematics · #97A99 #FOS: Mathematics #History and Overview (math.HO) #History and Theory of Mathematics #Numerical Methods and Algorithms #Rings and Algebras (math.RA) #Secondary: 13F99

paper · pdf · doi:10.48550/arxiv.0912.1296

openalex publication_date 2009/12/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We give an algorithm for factoring quadratic polynomials over any UFD, Z in particular. We prove the correctness of this algorithm and give examples over Z and Z[i].

Related

• Deducing factoring methods through concrete material
• Factorization of Non-Commutative Polynomials
• A Refined Conjecture For Factoring Iterates Of Quadratic Polynomials Over Finite Fields
• Factoring Octonion Polynomials
• Factoring Ore polynomials over \mathbbF_q(t) is difficult