FACTORIZATION OF POLYNOMIAL INTEGER NUMBERS AND THEIR ALGORITHMS

• DOI: https://doi.org/10.22533/at.ed.3175725170714

• Palavras-chave: Factorization, Integers, Algorithms, Computer programs, Software, Theorem.

• Keywords: Factorization, Integers, Algorithms, Computer programs, Software, Theorem.

• Abstract:

  Cordero's factorization method is based on a set of theorems and algorithms that allow the factorization of polynomial integers, that is, integers that can be expressed through specific polynomial formulas. Unlike traditional methods of integer factorization that attempt to decompose any number, this research focuses on particular forms of integers. The method provides formulas for decomposing certain polynomial numbers into two factors, which are the mathematical basis of the algorithms that completely factorize these two integers obtained through the formulas.