Upper bounds on the number of irreducible factors of certain integer polynomials are obtained from prime factorizations of evaluated values and complex root locations, extending to bivariate polynomials via non-Archimedean valuations.
Euler le pere ´ a M
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Prime numbers and factorization of polynomials
Upper bounds on the number of irreducible factors of certain integer polynomials are obtained from prime factorizations of evaluated values and complex root locations, extending to bivariate polynomials via non-Archimedean valuations.