Irreducibility of a polynomial over Rationals with condition given on its coefficients.











up vote
0
down vote

favorite
1












Let $f = a_nX^n+cdots+a_1Xpm p in mathbb{Z}[X]$ with $sum_{i=1}^n |a_i| < p$. Show that $f$ is irreducible in $mathbb{Q}[X]$.



Hint: Show that every root of $f in mathbb{C}$ has modulus greater than $1$ and consider leading and constant terms of a factor of $f$.



I have been able to show that every roots has modulus greater than $1$. But I am not able to go any further? Please help.










share|cite|improve this question


























    up vote
    0
    down vote

    favorite
    1












    Let $f = a_nX^n+cdots+a_1Xpm p in mathbb{Z}[X]$ with $sum_{i=1}^n |a_i| < p$. Show that $f$ is irreducible in $mathbb{Q}[X]$.



    Hint: Show that every root of $f in mathbb{C}$ has modulus greater than $1$ and consider leading and constant terms of a factor of $f$.



    I have been able to show that every roots has modulus greater than $1$. But I am not able to go any further? Please help.










    share|cite|improve this question
























      up vote
      0
      down vote

      favorite
      1









      up vote
      0
      down vote

      favorite
      1






      1





      Let $f = a_nX^n+cdots+a_1Xpm p in mathbb{Z}[X]$ with $sum_{i=1}^n |a_i| < p$. Show that $f$ is irreducible in $mathbb{Q}[X]$.



      Hint: Show that every root of $f in mathbb{C}$ has modulus greater than $1$ and consider leading and constant terms of a factor of $f$.



      I have been able to show that every roots has modulus greater than $1$. But I am not able to go any further? Please help.










      share|cite|improve this question













      Let $f = a_nX^n+cdots+a_1Xpm p in mathbb{Z}[X]$ with $sum_{i=1}^n |a_i| < p$. Show that $f$ is irreducible in $mathbb{Q}[X]$.



      Hint: Show that every root of $f in mathbb{C}$ has modulus greater than $1$ and consider leading and constant terms of a factor of $f$.



      I have been able to show that every roots has modulus greater than $1$. But I am not able to go any further? Please help.







      roots irreducible-polynomials rational-numbers






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 22 at 14:21









      Mittal G

      1,182515




      1,182515






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          0
          down vote













          If $f(x)=a_nx^n+a_{n-1}x^{n-1}+ldots+a_1x+(-1)^up$ has a solution in $mathbb{Q}$ which is $r/s$ with $gcd(r,s)=1$, then $a_nr^n+a_{n-1}r^{n-1}s+ldots+a_1rs^{n-1}+(-1)^ups^n=0\Rightarrow r(a_nr^{n-1}+a_{n-2}r^{n-1}s+ldots+a_1s^{n-1})=-(-1)^ups^n\Rightarrow r|p.$



          If $p$ is prime then we have a contradiction.



          If $p$ is not prime then we have a counterexample $f(x)=x^2+x-6$






          share|cite|improve this answer

















          • 2




            How to show that $f(x)$ has no irreducible factor? With no roots doesn't means irreducibility.
            – Mittal G
            Nov 22 at 14:47













          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "69"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3009190%2firreducibility-of-a-polynomial-over-rationals-with-condition-given-on-its-coeffi%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          0
          down vote













          If $f(x)=a_nx^n+a_{n-1}x^{n-1}+ldots+a_1x+(-1)^up$ has a solution in $mathbb{Q}$ which is $r/s$ with $gcd(r,s)=1$, then $a_nr^n+a_{n-1}r^{n-1}s+ldots+a_1rs^{n-1}+(-1)^ups^n=0\Rightarrow r(a_nr^{n-1}+a_{n-2}r^{n-1}s+ldots+a_1s^{n-1})=-(-1)^ups^n\Rightarrow r|p.$



          If $p$ is prime then we have a contradiction.



          If $p$ is not prime then we have a counterexample $f(x)=x^2+x-6$






          share|cite|improve this answer

















          • 2




            How to show that $f(x)$ has no irreducible factor? With no roots doesn't means irreducibility.
            – Mittal G
            Nov 22 at 14:47

















          up vote
          0
          down vote













          If $f(x)=a_nx^n+a_{n-1}x^{n-1}+ldots+a_1x+(-1)^up$ has a solution in $mathbb{Q}$ which is $r/s$ with $gcd(r,s)=1$, then $a_nr^n+a_{n-1}r^{n-1}s+ldots+a_1rs^{n-1}+(-1)^ups^n=0\Rightarrow r(a_nr^{n-1}+a_{n-2}r^{n-1}s+ldots+a_1s^{n-1})=-(-1)^ups^n\Rightarrow r|p.$



          If $p$ is prime then we have a contradiction.



          If $p$ is not prime then we have a counterexample $f(x)=x^2+x-6$






          share|cite|improve this answer

















          • 2




            How to show that $f(x)$ has no irreducible factor? With no roots doesn't means irreducibility.
            – Mittal G
            Nov 22 at 14:47















          up vote
          0
          down vote










          up vote
          0
          down vote









          If $f(x)=a_nx^n+a_{n-1}x^{n-1}+ldots+a_1x+(-1)^up$ has a solution in $mathbb{Q}$ which is $r/s$ with $gcd(r,s)=1$, then $a_nr^n+a_{n-1}r^{n-1}s+ldots+a_1rs^{n-1}+(-1)^ups^n=0\Rightarrow r(a_nr^{n-1}+a_{n-2}r^{n-1}s+ldots+a_1s^{n-1})=-(-1)^ups^n\Rightarrow r|p.$



          If $p$ is prime then we have a contradiction.



          If $p$ is not prime then we have a counterexample $f(x)=x^2+x-6$






          share|cite|improve this answer












          If $f(x)=a_nx^n+a_{n-1}x^{n-1}+ldots+a_1x+(-1)^up$ has a solution in $mathbb{Q}$ which is $r/s$ with $gcd(r,s)=1$, then $a_nr^n+a_{n-1}r^{n-1}s+ldots+a_1rs^{n-1}+(-1)^ups^n=0\Rightarrow r(a_nr^{n-1}+a_{n-2}r^{n-1}s+ldots+a_1s^{n-1})=-(-1)^ups^n\Rightarrow r|p.$



          If $p$ is prime then we have a contradiction.



          If $p$ is not prime then we have a counterexample $f(x)=x^2+x-6$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 22 at 14:39









          John_Wick

          1,134111




          1,134111








          • 2




            How to show that $f(x)$ has no irreducible factor? With no roots doesn't means irreducibility.
            – Mittal G
            Nov 22 at 14:47
















          • 2




            How to show that $f(x)$ has no irreducible factor? With no roots doesn't means irreducibility.
            – Mittal G
            Nov 22 at 14:47










          2




          2




          How to show that $f(x)$ has no irreducible factor? With no roots doesn't means irreducibility.
          – Mittal G
          Nov 22 at 14:47






          How to show that $f(x)$ has no irreducible factor? With no roots doesn't means irreducibility.
          – Mittal G
          Nov 22 at 14:47




















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3009190%2firreducibility-of-a-polynomial-over-rationals-with-condition-given-on-its-coeffi%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Ellipse (mathématiques)

          Quarter-circle Tiles

          Mont Emei