Cohn's irreducibility criterion

Cohn's irreducibility criterion Arthur Cohn's irreducibility criterion is a sufficient condition for a polynomial to be irreducible in {displaystyle mathbb {Z} [x]} —that is, for it to be unfactorable into the product of lower-degree polynomials with integer coefficients.

The criterion is often stated as follows: If a prime number {displaystyle p} is expressed in base 10 as {displaystyle p=a_{m}10^{m}+a_{m-1}10^{m-1}+cdots +a_{1}10+a_{0}} (where {displaystyle 0leq a_{i}leq 9} ) then the polynomial {displaystyle f(x)=a_{m}x^{m}+a_{m-1}x^{m-1}+cdots +a_{1}x+a_{0}} is irreducible in {displaystyle mathbb {Z} [x]} .

The theorem can be generalized to other bases as follows: Assume that {displaystyle bgeq 2} is a natural number and {displaystyle p(x)=a_{k}x^{k}+a_{k-1}x^{k-1}+cdots +a_{1}x+a_{0}} is a polynomial such that {displaystyle 0leq a_{i}leq b-1} . If {displaystyle p(b)} is a prime number then {displaystyle p(x)} is irreducible in {displaystyle mathbb {Z} [x]} .

The base 10 version of the theorem is attributed to Cohn by Pólya and Szegő in one of their books[1] while the generalization to any base b is due to Brillhart, Filaseta, and Odlyzko.[2] In 2002, Ram Murty gave a simplified proof as well as some history of the theorem in a paper that is available online.[3] A further generalization of the theorem allowing coefficients larger than digits was given by Filaseta and Gross.[4] In particular, let {displaystyle f(x)} be a polynomial with non-negative integer coefficients such that {displaystyle f(10)} is prime. If all coefficients are {displaystyle leq } 49598666989151226098104244512918, then {displaystyle f(x)} is irreducible over {displaystyle mathbb {Z} [x]} . Moreover, they proved that this bound is also sharp. In other words, coefficients larger than 49598666989151226098104244512918 do not guarantee irreducibility. The method of Filaseta and Gross was also generalized to provide similar sharp bounds for some other bases by Cole, Dunn, and Filaseta.[5] The converse of this criterion is that, if p is an irreducible polynomial with integer coefficients that have greatest common divisor 1, then there exists a base such that the coefficients of p form the representation of a prime number in that base; this is the Bunyakovsky conjecture and its truth or falsity remains an open question.

Contents 1 Historical notes 2 See also 3 References 4 External links Historical notes Polya and Szegő gave their own generalization but it has many side conditions (on the locations of the roots, for instance)[citation needed] so it lacks the elegance of Brillhart's, Filaseta's, and Odlyzko's generalization. It is clear from context that the "A. Cohn" mentioned by Polya and Szegő is Arthur Cohn (1894–1940), a student of Issai Schur who was awarded his doctorate from Frederick William University in 1921.[6][7] See also Eisenstein's criterion Perron's irreducibility criterion References ^ Pólya, George; Szegő, Gábor (1925). Aufgaben und Lehrsätze aus der Analysis, Bd 2. Springer, Berlin. OCLC 73165700. English translation in: Pólya, George; Szegő, Gábor (2004). Problems and theorems in analysis, volume 2. Vol. 2. Springer. p. 137. ISBN 978-3-540-63686-1. ^ Brillhart, John; Filaseta, Michael; Odlyzko, Andrew (1981). "On an irreducibility theorem of A. Cohn". Canadian Journal of Mathematics. 33 (5): 1055–1059. doi:10.4153/CJM-1981-080-0. ^ Murty, Ram (2002). "Prime Numbers and Irreducible Polynomials" (PDF). American Mathematical Monthly. 109 (5): 452–458. CiteSeerX doi:10.2307/2695645. JSTOR 2695645. (dvi file) ^ Filaseta, Michael; Gross, Samuel S. (2014). "49598666989151226098104244512918". Journal of Number Theory. 137: 16–49. doi:10.1016/j.jnt.2013.11.001. ^ Cole, Morgan; Dunn, Scott; Filaseta, Michael (2016). "Further irreducibility criteria for polynomials with non-negative coefficients". Acta Arithmetica. 175: 137–181. doi:10.4064/aa8376-5-2016. ^ Arthur Cohn's entry at the Mathematics Genealogy Project ^ Siegmund-Schultze, Reinhard (2009). Mathematicians Fleeing from Nazi Germany: Individual Fates and Global Impact. Princeton, N.J.: Princeton University Press. p. 346. ISBN 9781400831401. External links "A. Cohn's irreducibility criterion". PlanetMath. Categories: PolynomialsTheorems in algebra

Si quieres conocer otros artículos parecidos a Cohn's irreducibility criterion puedes visitar la categoría Polynomials.

Deja una respuesta

Tu dirección de correo electrónico no será publicada.


Utilizamos cookies propias y de terceros para mejorar la experiencia de usuario Más información