The factorization of \(f(x)x^{ n }+g(x)\) with \(f(x)\) monic and of degree \(\leq 2\) (Q2448539): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.5802/jtnb.849 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.5802/jtnb.849 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2979101059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Irreducibility of Polynomials with Large Third Coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Irreducibility of Polynomials with Large Third Coefficient. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4837918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an irreducibility theorem of A. Schinzel associated with coverings of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE FACTORIZATION OF THE TRINOMIALS x<sup>n</sup> + cx<sup>n-1</sup> + d / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reducibility of polynomials and in particular of trinomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility of polynomials and covering systems of congruences / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.5802/JTNB.849 / rank
 
Normal rank

Latest revision as of 17:04, 18 December 2024

scientific article
Language Label Description Also known as
English
The factorization of \(f(x)x^{ n }+g(x)\) with \(f(x)\) monic and of degree \(\leq 2\)
scientific article

    Statements

    The factorization of \(f(x)x^{ n }+g(x)\) with \(f(x)\) monic and of degree \(\leq 2\) (English)
    0 references
    0 references
    2 May 2014
    0 references
    Let \(f(X)=X^2+bX+c\in Z[X]\) with \(c\geq2\), \(|b|<2\sqrt{c-1}\), and let \(g\in Z[X]\), \(\deg g=t\). The author shows that under certain assumptions on the coefficients of \(g\) (depending on \(f\)) the polynomial \(f(X)X^n+g(X)\) is reducible for all \(n > n_0(f,t)\). This leads to a series of corollaries asserting irreducibility for certain families of polynomials.
    0 references
    irreducibility criteria
    0 references
    factorization of polynomials
    0 references
    quadratic polynomial
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references