Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $f(x)=x^n+5x^{n-1}+3$ where $n\geq1$ is an integer.Prove that $f(x)$ can't be expressed as the product of two polynomials each of which has all its coefficients integers and degree$\geq1$. If the condition that each polynomial must have all its coefficients integers was not there, then I needed to show only that $f(x)$ is irreducible over real numbers.But since this condition is given,therefore,we can't exclude the case when $f(x)$ is reducible over real numbers but not with polynomials of integer coefficients.Anyone with idea how to proceed?Thanks in advance!!

share|improve this question
2  
This is a classic application of Perron's criterion (mathoverflow.net/questions/8182/…), which can be proven using Rouche's theorem in complex analysis. I am not aware of another approach. –  Qiaochu Yuan Jun 28 '12 at 5:42
add comment

2 Answers

up vote 10 down vote accepted

The notation $[x^t]P(x)$ denotes the coefficient of $x^t$ in polynomial $P(x)$.

Suppose that $f(x)=g(x)h(x)$, where $g(x),h(x)$ are monic polynomials, $g(x),h(x)\in\Bbb Z[x]$ and $\deg g>0$, $\deg h>0$, $\deg g+\deg h=n$. Let $g(x)=\sum_k\alpha_kx^k$, $h(x)=\sum_k\beta_kx^k$, where $\alpha_k,\beta_k$ is integer whenever $k\ge0$.

First, we have $\alpha_0\beta_0=3$, so $|\alpha_0|=3$ and $|\beta_0|=1$ or $|\alpha_0|=1$ and $|\beta_0|=3$. WLOG, suppose that $|\alpha_0|=3$ and $|\beta_0|=1$. Let $m$ is the smallest positive integer such that $3\nmid\alpha_m$ (such $m$ exists because $g(x)$ is monic). Now we have $$[z^m]f(x)=\alpha_0\beta_m+\alpha_1\beta_{m-1}+\cdots+\alpha_m\beta_0\equiv\alpha_m\beta_0\not\equiv0\pmod3$$ So $m\ge n-1$, and $\deg g\ge n-1$, thus $\deg h\le 1$, hence $\deg h=1$, and $h(x)=x+\beta_0$, where $\beta_0=\pm1$, so $h(\beta_0)=0$, and $f(\beta_0)=0$, but it's obvious that $f(\pm1)\neq0$, Q.E.D.

share|improve this answer
2  
+1 This is a very nice argument. It is, of course, an example of using a $3$-adic Newton's polygon, but could also be given as a challenge question after introducing Eisenstein's criterion. –  Jyrki Lahtonen Jun 28 '12 at 8:09
    
@JyrkiLahtonen You remind me of Eisenstein's criterion, and I'm just aware that my proof is just a varient of the proof for Eisenstein's criterion. –  Frank Science Jun 28 '12 at 8:13
1  
@Jyrki It's a minor variant of Eisenstein - see my answer. Of course Newton polygon's are the Master Theorem here. –  Bill Dubuque Jun 28 '12 at 17:20
add comment

Hint $\ $ This is a minor variant of Eisenstein's criterion. Mod $3$ it factors as $\rm\:x^{n-1}(x+5)\:$ so by uniqueness of factorization if $\rm\:f = gh\:$ then, mod $3,\,$ $\rm\:g = x^j,\, $ $\rm\,h = x^k(x+5),\,$ $\rm\:j\!+\!k = n\!-\!1.\,$ But not $\rm\,j,k > 0\,$ else $\rm\:3\:|\:g(0),h(0)\:$ $\Rightarrow$ $\rm\:9\:|\:g(0)h(0)=f(0).\:$ Hence either $\rm\:j=0,\:$ so $\rm\:f\:$ is irreducible, or $\rm\:k=0,\:$ and $\rm\:f\:$ has a linear factor $\rm\:g,\:$ which is easily ruled out. $\ \ $ QED

share|improve this answer
3  
(+1) But shouldn't that read Proof instead of Hint? –  Pedro Tamaroff Jun 28 '12 at 17:20
    
+1 Yes, another nice natural route to bound the degree of potential factors. That seems to be the theme here. –  Jyrki Lahtonen Jun 28 '12 at 20:41
    
I have a doubt yesterday. For example, if $\Bbb Z_p=\{0,1,\ldots,p-1\}$, can we conclude that $\Bbb Z_p[x]$ is an Euclidean domain? The uniqueness of factorization might work in such case, but I'm not sure because I'm just a high-school student without good education of algebra. –  Frank Science Jun 29 '12 at 1:50
    
@Frank Yes, a polynomial ring $\rm\:F[x]\:$ over a field $\rm\:F\:$ is a Euclidean domain (via the high-school long division algorithm), so it is a unique factorization domain. This is proved in most every course in university algebra. –  Bill Dubuque Jun 29 '12 at 2:27
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.