How can i find a inverse of a polynomial in a quotient ring?












3












$begingroup$


I am asked to find the inverse of $widehat {x^3+1} $ in Q/[x]/I where I = $x^2-2$.



I am used to find the inverse by keep doing the division until a find a irreducible elements but the degree of the polynomial i asked to find the inverse is larger than the degree of polynomial in I.



In previous question, we have calculated the inverse of $widehat {X} $ which is $1/2$(X). And i am trying to breaking down $X^3 - 1 $ into $X(X^2-2)$ + $(2X+1)$. Is this bit some hints to approach this question or is it a new idea to find the inverse with a polynomial of a larger degree?



Thanks a lot!!






abstract-algebra polynomials ring-theory inverse







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    This is more or less the same as computing $1/((sqrt2)^3+1)$ in surds.
    $endgroup$
    – Lord Shark the Unknown
    Feb 4 at 19:24










  • $begingroup$
    Your calculation (breaking down $x^3+1$) shows that $widehat{x^3+1}=widehat{2x+1}$. Go from there.
    $endgroup$
    – Jyrki Lahtonen
    Feb 4 at 19:32


















3












$begingroup$


I am asked to find the inverse of $widehat {x^3+1} $ in Q/[x]/I where I = $x^2-2$.



I am used to find the inverse by keep doing the division until a find a irreducible elements but the degree of the polynomial i asked to find the inverse is larger than the degree of polynomial in I.



In previous question, we have calculated the inverse of $widehat {X} $ which is $1/2$(X). And i am trying to breaking down $X^3 - 1 $ into $X(X^2-2)$ + $(2X+1)$. Is this bit some hints to approach this question or is it a new idea to find the inverse with a polynomial of a larger degree?



Thanks a lot!!






abstract-algebra polynomials ring-theory inverse







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    This is more or less the same as computing $1/((sqrt2)^3+1)$ in surds.
    $endgroup$
    – Lord Shark the Unknown
    Feb 4 at 19:24










  • $begingroup$
    Your calculation (breaking down $x^3+1$) shows that $widehat{x^3+1}=widehat{2x+1}$. Go from there.
    $endgroup$
    – Jyrki Lahtonen
    Feb 4 at 19:32
















3












3








3





$begingroup$


I am asked to find the inverse of $widehat {x^3+1} $ in Q/[x]/I where I = $x^2-2$.



I am used to find the inverse by keep doing the division until a find a irreducible elements but the degree of the polynomial i asked to find the inverse is larger than the degree of polynomial in I.



In previous question, we have calculated the inverse of $widehat {X} $ which is $1/2$(X). And i am trying to breaking down $X^3 - 1 $ into $X(X^2-2)$ + $(2X+1)$. Is this bit some hints to approach this question or is it a new idea to find the inverse with a polynomial of a larger degree?



Thanks a lot!!






abstract-algebra polynomials ring-theory inverse







share|cite|improve this question











$endgroup$




I am asked to find the inverse of $widehat {x^3+1} $ in Q/[x]/I where I = $x^2-2$.



I am used to find the inverse by keep doing the division until a find a irreducible elements but the degree of the polynomial i asked to find the inverse is larger than the degree of polynomial in I.



In previous question, we have calculated the inverse of $widehat {X} $ which is $1/2$(X). And i am trying to breaking down $X^3 - 1 $ into $X(X^2-2)$ + $(2X+1)$. Is this bit some hints to approach this question or is it a new idea to find the inverse with a polynomial of a larger degree?



Thanks a lot!!






abstract-algebra polynomials ring-theory inverse




abstract-algebra polynomials ring-theory inverse






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Feb 8 at 15:30







Thomas

















asked Feb 4 at 19:15









ThomasThomas

706




706








  • 1




    $begingroup$
    This is more or less the same as computing $1/((sqrt2)^3+1)$ in surds.
    $endgroup$
    – Lord Shark the Unknown
    Feb 4 at 19:24










  • $begingroup$
    Your calculation (breaking down $x^3+1$) shows that $widehat{x^3+1}=widehat{2x+1}$. Go from there.
    $endgroup$
    – Jyrki Lahtonen
    Feb 4 at 19:32
















  • 1




    $begingroup$
    This is more or less the same as computing $1/((sqrt2)^3+1)$ in surds.
    $endgroup$
    – Lord Shark the Unknown
    Feb 4 at 19:24










  • $begingroup$
    Your calculation (breaking down $x^3+1$) shows that $widehat{x^3+1}=widehat{2x+1}$. Go from there.
    $endgroup$
    – Jyrki Lahtonen
    Feb 4 at 19:32










1




1




$begingroup$
This is more or less the same as computing $1/((sqrt2)^3+1)$ in surds.
$endgroup$
– Lord Shark the Unknown
Feb 4 at 19:24




$begingroup$
This is more or less the same as computing $1/((sqrt2)^3+1)$ in surds.
$endgroup$
– Lord Shark the Unknown
Feb 4 at 19:24












$begingroup$
Your calculation (breaking down $x^3+1$) shows that $widehat{x^3+1}=widehat{2x+1}$. Go from there.
$endgroup$
– Jyrki Lahtonen
Feb 4 at 19:32






$begingroup$
Your calculation (breaking down $x^3+1$) shows that $widehat{x^3+1}=widehat{2x+1}$. Go from there.
$endgroup$
– Jyrki Lahtonen
Feb 4 at 19:32












3 Answers
3






active

oldest

votes


















3












$begingroup$

Hint $ color{#c00}{x^2 = 2} Rightarrow dfrac{1}{1+color{#c00}{x^2} x} ,=, dfrac{1}{1+color{#c00}2x} = dfrac{1}{1+2color{#c00}x}, dfrac{1-2x}{1-2color{#c00}x} = dfrac{1,-,2x }{1-4(color{#c00}2)}$



i.e. $ $ rationalize the denom of $, dfrac{1}{1+2sqrt{2}}.,$ More generally, use the Extended Euclidean Algorithm.



For much further discussion see here and its links.






share|cite|improve this answer











$endgroup$





















    1












    $begingroup$

    extended Euc:



    $$ left( x^{3} + 1 right) $$



    $$ left( x^{2} - 2 right) $$



    $$ left( x^{3} + 1 right) = left( x^{2} - 2 right) cdot color{magenta}{ left( x right) } + left( 2 x + 1 right) $$
    $$ left( x^{2} - 2 right) = left( 2 x + 1 right) cdot color{magenta}{ left( frac{ 2 x - 1 }{ 4 } right) } + left( frac{ -7}{4 } right) $$
    $$ left( 2 x + 1 right) = left( frac{ -7}{4 } right) cdot color{magenta}{ left( frac{ - 8 x - 4 }{ 7 } right) } + left( 0 right) $$
    $$ frac{ 0}{1} $$
    $$ frac{ 1}{0} $$
    $$ color{magenta}{ left( x right) } Longrightarrow Longrightarrow frac{ left( x right) }{ left( 1 right) } $$
    $$ color{magenta}{ left( frac{ 2 x - 1 }{ 4 } right) } Longrightarrow Longrightarrow frac{ left( frac{ 2 x^{2} - x + 4 }{ 4 } right) }{ left( frac{ 2 x - 1 }{ 4 } right) } $$
    $$ color{magenta}{ left( frac{ - 8 x - 4 }{ 7 } right) } Longrightarrow Longrightarrow frac{ left( frac{ - 4 x^{3} - 4 }{ 7 } right) }{ left( frac{ - 4 x^{2} + 8 }{ 7 } right) } $$
    $$ left( x^{3} + 1 right) left( frac{ 2 x - 1 }{ 7 } right) - left( x^{2} - 2 right) left( frac{ 2 x^{2} - x + 4 }{ 7 } right) = left( 1 right) $$






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      If one insists on using the longer way of the extended Euclidean algorithm, then it is much clearer & simpler to use it in the augmented matrix form.
      $endgroup$
      – Bill Dubuque
      Feb 4 at 20:46












    • $begingroup$
      @BillDubuque I am very fond of continued fractions, and was delighted to learn Bezout for (rational) polynomials could also be done that way. Matter of taste, I guess, or of effort invested.
      $endgroup$
      – Will Jagy
      Feb 4 at 20:53










    • $begingroup$
      Certainly CFs are useful but - as in this critique of a similar prior answer - it will likely prove incomprehensible to most readers without a link to a careful explanation of the method. I always link my extended Euclidean algorithm answers to a detailed exposition and this seems to work well in this regard (I get very few questions).
      $endgroup$
      – Bill Dubuque
      Feb 11 at 16:24





















    1












    $begingroup$

    Applying the generalized Euclidean algorithm to $x^3+1$ and to $x^2-2$, you get that$$-frac74=left(frac{x^2}2-frac x4+1right)(x^2-2)-left(frac x2-frac14right)(x^3+1).$$Therefore,$$left(-frac{2x^2}7+frac x7-frac47right)(x^2-2)+left(frac{2x}7-frac17right)(x^3+1)=1$$and so the inverse of $x^3+1$ in $mathbb{Q}[x]/langle x^2-2rangle$ is $dfrac{2x}7-dfrac17$.






    share|cite|improve this answer











    $endgroup$













      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',
      autoActivateHeartbeat: false,
      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%2f3100289%2fhow-can-i-find-a-inverse-of-a-polynomial-in-a-quotient-ring%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      3












      $begingroup$

      Hint $ color{#c00}{x^2 = 2} Rightarrow dfrac{1}{1+color{#c00}{x^2} x} ,=, dfrac{1}{1+color{#c00}2x} = dfrac{1}{1+2color{#c00}x}, dfrac{1-2x}{1-2color{#c00}x} = dfrac{1,-,2x }{1-4(color{#c00}2)}$



      i.e. $ $ rationalize the denom of $, dfrac{1}{1+2sqrt{2}}.,$ More generally, use the Extended Euclidean Algorithm.



      For much further discussion see here and its links.






      share|cite|improve this answer











      $endgroup$


















        3












        $begingroup$

        Hint $ color{#c00}{x^2 = 2} Rightarrow dfrac{1}{1+color{#c00}{x^2} x} ,=, dfrac{1}{1+color{#c00}2x} = dfrac{1}{1+2color{#c00}x}, dfrac{1-2x}{1-2color{#c00}x} = dfrac{1,-,2x }{1-4(color{#c00}2)}$



        i.e. $ $ rationalize the denom of $, dfrac{1}{1+2sqrt{2}}.,$ More generally, use the Extended Euclidean Algorithm.



        For much further discussion see here and its links.






        share|cite|improve this answer











        $endgroup$
















          3












          3








          3





          $begingroup$

          Hint $ color{#c00}{x^2 = 2} Rightarrow dfrac{1}{1+color{#c00}{x^2} x} ,=, dfrac{1}{1+color{#c00}2x} = dfrac{1}{1+2color{#c00}x}, dfrac{1-2x}{1-2color{#c00}x} = dfrac{1,-,2x }{1-4(color{#c00}2)}$



          i.e. $ $ rationalize the denom of $, dfrac{1}{1+2sqrt{2}}.,$ More generally, use the Extended Euclidean Algorithm.



          For much further discussion see here and its links.






          share|cite|improve this answer











          $endgroup$



          Hint $ color{#c00}{x^2 = 2} Rightarrow dfrac{1}{1+color{#c00}{x^2} x} ,=, dfrac{1}{1+color{#c00}2x} = dfrac{1}{1+2color{#c00}x}, dfrac{1-2x}{1-2color{#c00}x} = dfrac{1,-,2x }{1-4(color{#c00}2)}$



          i.e. $ $ rationalize the denom of $, dfrac{1}{1+2sqrt{2}}.,$ More generally, use the Extended Euclidean Algorithm.



          For much further discussion see here and its links.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Feb 11 at 16:36

























          answered Feb 4 at 19:44









          Bill DubuqueBill Dubuque

          213k29195654




          213k29195654























              1












              $begingroup$

              extended Euc:



              $$ left( x^{3} + 1 right) $$



              $$ left( x^{2} - 2 right) $$



              $$ left( x^{3} + 1 right) = left( x^{2} - 2 right) cdot color{magenta}{ left( x right) } + left( 2 x + 1 right) $$
              $$ left( x^{2} - 2 right) = left( 2 x + 1 right) cdot color{magenta}{ left( frac{ 2 x - 1 }{ 4 } right) } + left( frac{ -7}{4 } right) $$
              $$ left( 2 x + 1 right) = left( frac{ -7}{4 } right) cdot color{magenta}{ left( frac{ - 8 x - 4 }{ 7 } right) } + left( 0 right) $$
              $$ frac{ 0}{1} $$
              $$ frac{ 1}{0} $$
              $$ color{magenta}{ left( x right) } Longrightarrow Longrightarrow frac{ left( x right) }{ left( 1 right) } $$
              $$ color{magenta}{ left( frac{ 2 x - 1 }{ 4 } right) } Longrightarrow Longrightarrow frac{ left( frac{ 2 x^{2} - x + 4 }{ 4 } right) }{ left( frac{ 2 x - 1 }{ 4 } right) } $$
              $$ color{magenta}{ left( frac{ - 8 x - 4 }{ 7 } right) } Longrightarrow Longrightarrow frac{ left( frac{ - 4 x^{3} - 4 }{ 7 } right) }{ left( frac{ - 4 x^{2} + 8 }{ 7 } right) } $$
              $$ left( x^{3} + 1 right) left( frac{ 2 x - 1 }{ 7 } right) - left( x^{2} - 2 right) left( frac{ 2 x^{2} - x + 4 }{ 7 } right) = left( 1 right) $$






              share|cite|improve this answer









              $endgroup$













              • $begingroup$
                If one insists on using the longer way of the extended Euclidean algorithm, then it is much clearer & simpler to use it in the augmented matrix form.
                $endgroup$
                – Bill Dubuque
                Feb 4 at 20:46












              • $begingroup$
                @BillDubuque I am very fond of continued fractions, and was delighted to learn Bezout for (rational) polynomials could also be done that way. Matter of taste, I guess, or of effort invested.
                $endgroup$
                – Will Jagy
                Feb 4 at 20:53










              • $begingroup$
                Certainly CFs are useful but - as in this critique of a similar prior answer - it will likely prove incomprehensible to most readers without a link to a careful explanation of the method. I always link my extended Euclidean algorithm answers to a detailed exposition and this seems to work well in this regard (I get very few questions).
                $endgroup$
                – Bill Dubuque
                Feb 11 at 16:24


















              1












              $begingroup$

              extended Euc:



              $$ left( x^{3} + 1 right) $$



              $$ left( x^{2} - 2 right) $$



              $$ left( x^{3} + 1 right) = left( x^{2} - 2 right) cdot color{magenta}{ left( x right) } + left( 2 x + 1 right) $$
              $$ left( x^{2} - 2 right) = left( 2 x + 1 right) cdot color{magenta}{ left( frac{ 2 x - 1 }{ 4 } right) } + left( frac{ -7}{4 } right) $$
              $$ left( 2 x + 1 right) = left( frac{ -7}{4 } right) cdot color{magenta}{ left( frac{ - 8 x - 4 }{ 7 } right) } + left( 0 right) $$
              $$ frac{ 0}{1} $$
              $$ frac{ 1}{0} $$
              $$ color{magenta}{ left( x right) } Longrightarrow Longrightarrow frac{ left( x right) }{ left( 1 right) } $$
              $$ color{magenta}{ left( frac{ 2 x - 1 }{ 4 } right) } Longrightarrow Longrightarrow frac{ left( frac{ 2 x^{2} - x + 4 }{ 4 } right) }{ left( frac{ 2 x - 1 }{ 4 } right) } $$
              $$ color{magenta}{ left( frac{ - 8 x - 4 }{ 7 } right) } Longrightarrow Longrightarrow frac{ left( frac{ - 4 x^{3} - 4 }{ 7 } right) }{ left( frac{ - 4 x^{2} + 8 }{ 7 } right) } $$
              $$ left( x^{3} + 1 right) left( frac{ 2 x - 1 }{ 7 } right) - left( x^{2} - 2 right) left( frac{ 2 x^{2} - x + 4 }{ 7 } right) = left( 1 right) $$






              share|cite|improve this answer









              $endgroup$













              • $begingroup$
                If one insists on using the longer way of the extended Euclidean algorithm, then it is much clearer & simpler to use it in the augmented matrix form.
                $endgroup$
                – Bill Dubuque
                Feb 4 at 20:46












              • $begingroup$
                @BillDubuque I am very fond of continued fractions, and was delighted to learn Bezout for (rational) polynomials could also be done that way. Matter of taste, I guess, or of effort invested.
                $endgroup$
                – Will Jagy
                Feb 4 at 20:53










              • $begingroup$
                Certainly CFs are useful but - as in this critique of a similar prior answer - it will likely prove incomprehensible to most readers without a link to a careful explanation of the method. I always link my extended Euclidean algorithm answers to a detailed exposition and this seems to work well in this regard (I get very few questions).
                $endgroup$
                – Bill Dubuque
                Feb 11 at 16:24
















              1












              1








              1





              $begingroup$

              extended Euc:



              $$ left( x^{3} + 1 right) $$



              $$ left( x^{2} - 2 right) $$



              $$ left( x^{3} + 1 right) = left( x^{2} - 2 right) cdot color{magenta}{ left( x right) } + left( 2 x + 1 right) $$
              $$ left( x^{2} - 2 right) = left( 2 x + 1 right) cdot color{magenta}{ left( frac{ 2 x - 1 }{ 4 } right) } + left( frac{ -7}{4 } right) $$
              $$ left( 2 x + 1 right) = left( frac{ -7}{4 } right) cdot color{magenta}{ left( frac{ - 8 x - 4 }{ 7 } right) } + left( 0 right) $$
              $$ frac{ 0}{1} $$
              $$ frac{ 1}{0} $$
              $$ color{magenta}{ left( x right) } Longrightarrow Longrightarrow frac{ left( x right) }{ left( 1 right) } $$
              $$ color{magenta}{ left( frac{ 2 x - 1 }{ 4 } right) } Longrightarrow Longrightarrow frac{ left( frac{ 2 x^{2} - x + 4 }{ 4 } right) }{ left( frac{ 2 x - 1 }{ 4 } right) } $$
              $$ color{magenta}{ left( frac{ - 8 x - 4 }{ 7 } right) } Longrightarrow Longrightarrow frac{ left( frac{ - 4 x^{3} - 4 }{ 7 } right) }{ left( frac{ - 4 x^{2} + 8 }{ 7 } right) } $$
              $$ left( x^{3} + 1 right) left( frac{ 2 x - 1 }{ 7 } right) - left( x^{2} - 2 right) left( frac{ 2 x^{2} - x + 4 }{ 7 } right) = left( 1 right) $$






              share|cite|improve this answer









              $endgroup$



              extended Euc:



              $$ left( x^{3} + 1 right) $$



              $$ left( x^{2} - 2 right) $$



              $$ left( x^{3} + 1 right) = left( x^{2} - 2 right) cdot color{magenta}{ left( x right) } + left( 2 x + 1 right) $$
              $$ left( x^{2} - 2 right) = left( 2 x + 1 right) cdot color{magenta}{ left( frac{ 2 x - 1 }{ 4 } right) } + left( frac{ -7}{4 } right) $$
              $$ left( 2 x + 1 right) = left( frac{ -7}{4 } right) cdot color{magenta}{ left( frac{ - 8 x - 4 }{ 7 } right) } + left( 0 right) $$
              $$ frac{ 0}{1} $$
              $$ frac{ 1}{0} $$
              $$ color{magenta}{ left( x right) } Longrightarrow Longrightarrow frac{ left( x right) }{ left( 1 right) } $$
              $$ color{magenta}{ left( frac{ 2 x - 1 }{ 4 } right) } Longrightarrow Longrightarrow frac{ left( frac{ 2 x^{2} - x + 4 }{ 4 } right) }{ left( frac{ 2 x - 1 }{ 4 } right) } $$
              $$ color{magenta}{ left( frac{ - 8 x - 4 }{ 7 } right) } Longrightarrow Longrightarrow frac{ left( frac{ - 4 x^{3} - 4 }{ 7 } right) }{ left( frac{ - 4 x^{2} + 8 }{ 7 } right) } $$
              $$ left( x^{3} + 1 right) left( frac{ 2 x - 1 }{ 7 } right) - left( x^{2} - 2 right) left( frac{ 2 x^{2} - x + 4 }{ 7 } right) = left( 1 right) $$







              share|cite|improve this answer












              share|cite|improve this answer



              share|cite|improve this answer










              answered Feb 4 at 20:28









              Will JagyWill Jagy

              104k5102201




              104k5102201












              • $begingroup$
                If one insists on using the longer way of the extended Euclidean algorithm, then it is much clearer & simpler to use it in the augmented matrix form.
                $endgroup$
                – Bill Dubuque
                Feb 4 at 20:46












              • $begingroup$
                @BillDubuque I am very fond of continued fractions, and was delighted to learn Bezout for (rational) polynomials could also be done that way. Matter of taste, I guess, or of effort invested.
                $endgroup$
                – Will Jagy
                Feb 4 at 20:53










              • $begingroup$
                Certainly CFs are useful but - as in this critique of a similar prior answer - it will likely prove incomprehensible to most readers without a link to a careful explanation of the method. I always link my extended Euclidean algorithm answers to a detailed exposition and this seems to work well in this regard (I get very few questions).
                $endgroup$
                – Bill Dubuque
                Feb 11 at 16:24




















              • $begingroup$
                If one insists on using the longer way of the extended Euclidean algorithm, then it is much clearer & simpler to use it in the augmented matrix form.
                $endgroup$
                – Bill Dubuque
                Feb 4 at 20:46












              • $begingroup$
                @BillDubuque I am very fond of continued fractions, and was delighted to learn Bezout for (rational) polynomials could also be done that way. Matter of taste, I guess, or of effort invested.
                $endgroup$
                – Will Jagy
                Feb 4 at 20:53










              • $begingroup$
                Certainly CFs are useful but - as in this critique of a similar prior answer - it will likely prove incomprehensible to most readers without a link to a careful explanation of the method. I always link my extended Euclidean algorithm answers to a detailed exposition and this seems to work well in this regard (I get very few questions).
                $endgroup$
                – Bill Dubuque
                Feb 11 at 16:24


















              $begingroup$
              If one insists on using the longer way of the extended Euclidean algorithm, then it is much clearer & simpler to use it in the augmented matrix form.
              $endgroup$
              – Bill Dubuque
              Feb 4 at 20:46






              $begingroup$
              If one insists on using the longer way of the extended Euclidean algorithm, then it is much clearer & simpler to use it in the augmented matrix form.
              $endgroup$
              – Bill Dubuque
              Feb 4 at 20:46














              $begingroup$
              @BillDubuque I am very fond of continued fractions, and was delighted to learn Bezout for (rational) polynomials could also be done that way. Matter of taste, I guess, or of effort invested.
              $endgroup$
              – Will Jagy
              Feb 4 at 20:53




              $begingroup$
              @BillDubuque I am very fond of continued fractions, and was delighted to learn Bezout for (rational) polynomials could also be done that way. Matter of taste, I guess, or of effort invested.
              $endgroup$
              – Will Jagy
              Feb 4 at 20:53












              $begingroup$
              Certainly CFs are useful but - as in this critique of a similar prior answer - it will likely prove incomprehensible to most readers without a link to a careful explanation of the method. I always link my extended Euclidean algorithm answers to a detailed exposition and this seems to work well in this regard (I get very few questions).
              $endgroup$
              – Bill Dubuque
              Feb 11 at 16:24






              $begingroup$
              Certainly CFs are useful but - as in this critique of a similar prior answer - it will likely prove incomprehensible to most readers without a link to a careful explanation of the method. I always link my extended Euclidean algorithm answers to a detailed exposition and this seems to work well in this regard (I get very few questions).
              $endgroup$
              – Bill Dubuque
              Feb 11 at 16:24













              1












              $begingroup$

              Applying the generalized Euclidean algorithm to $x^3+1$ and to $x^2-2$, you get that$$-frac74=left(frac{x^2}2-frac x4+1right)(x^2-2)-left(frac x2-frac14right)(x^3+1).$$Therefore,$$left(-frac{2x^2}7+frac x7-frac47right)(x^2-2)+left(frac{2x}7-frac17right)(x^3+1)=1$$and so the inverse of $x^3+1$ in $mathbb{Q}[x]/langle x^2-2rangle$ is $dfrac{2x}7-dfrac17$.






              share|cite|improve this answer











              $endgroup$


















                1












                $begingroup$

                Applying the generalized Euclidean algorithm to $x^3+1$ and to $x^2-2$, you get that$$-frac74=left(frac{x^2}2-frac x4+1right)(x^2-2)-left(frac x2-frac14right)(x^3+1).$$Therefore,$$left(-frac{2x^2}7+frac x7-frac47right)(x^2-2)+left(frac{2x}7-frac17right)(x^3+1)=1$$and so the inverse of $x^3+1$ in $mathbb{Q}[x]/langle x^2-2rangle$ is $dfrac{2x}7-dfrac17$.






                share|cite|improve this answer











                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  Applying the generalized Euclidean algorithm to $x^3+1$ and to $x^2-2$, you get that$$-frac74=left(frac{x^2}2-frac x4+1right)(x^2-2)-left(frac x2-frac14right)(x^3+1).$$Therefore,$$left(-frac{2x^2}7+frac x7-frac47right)(x^2-2)+left(frac{2x}7-frac17right)(x^3+1)=1$$and so the inverse of $x^3+1$ in $mathbb{Q}[x]/langle x^2-2rangle$ is $dfrac{2x}7-dfrac17$.






                  share|cite|improve this answer











                  $endgroup$



                  Applying the generalized Euclidean algorithm to $x^3+1$ and to $x^2-2$, you get that$$-frac74=left(frac{x^2}2-frac x4+1right)(x^2-2)-left(frac x2-frac14right)(x^3+1).$$Therefore,$$left(-frac{2x^2}7+frac x7-frac47right)(x^2-2)+left(frac{2x}7-frac17right)(x^3+1)=1$$and so the inverse of $x^3+1$ in $mathbb{Q}[x]/langle x^2-2rangle$ is $dfrac{2x}7-dfrac17$.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Feb 6 at 0:06









                  user26857

                  39.4k124183




                  39.4k124183










                  answered Feb 4 at 19:33









                  José Carlos SantosJosé Carlos Santos

                  170k23132238




                  170k23132238






























                      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.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3100289%2fhow-can-i-find-a-inverse-of-a-polynomial-in-a-quotient-ring%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

                      Human spaceflight

                      Image
                      Human spaceflight From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Space traveler" redirects here. For other uses, see Space traveler (disambiguation). @media all and (max-width:720px){.mw-parser-output .tmulti>.thumbinner{width:100%!important;max-width:none!important}.mw-parser-output .tmulti .tsingle{float:none!important;max-width:none!important;width:100%!important;text-align:center}} Apollo 11 crewmember Buzz Aldrin on the Moon, 1969 International Space Station crewmember Tracy Caldwell Dyson views the Earth, 2010 Space Shuttle Discovery heads into space with a crew aboard, STS-121 in 2006 Inside a space suit on the Canadarm, 1993 Human spaceflight (also referred to as crewed spaceflight or manned spaceflight ) is space travel with a crew or passengers aboard the spacecraft. Spacecraft carrying people may be operated directly, by human crew, or it may be e
                      Read more

                      Can not write log (Is /dev/pts mounted?) - openpty in Ubuntu-on-Windows?

                      Image
                      0 1 What exactly does the error message beginning with E: mean? I assume it has to do with the file structure on Ubuntu-on-Windows, but what exactly? The following package was automatically installed and is no longer required: os-prober Use 'apt-get autoremove' to remove it. The following extra packages will be installed: libxslt1.1 The following NEW packages will be installed: libxslt1.1 xmlstarlet 0 upgraded, 2 newly installed, 0 to remove and 0 not upgraded. Need to get 435 kB of archives. After this operation, 1023 kB of additional disk space will be used. Get:1 http://archive.ubuntu.com/ubuntu/ trusty/main libxslt1.1 amd64 1.1.28-2build1 [145 kB] Get:2 http://archive.ubuntu.com/ubuntu/ trusty/universe xmlstarlet amd64 1.5.0-1 [290 kB]
                      Read more

                      File:DeusFollowingSea.jpg

                      Image
                      File:DeusFollowingSea.jpg From Wikipedia, the free encyclopedia Jump to navigation Jump to search File File history File usage No higher resolution available. DeusFollowingSea.jpg ‎ (238 × 211 pixels, file size: 12 KB, MIME type: image/jpeg ) Summary [ edit ] Media data and Non-free use rationale Description Cover art of the Deus CD Following Sea Author or copyright owner Deus Source (WP:NFCC#4) rocksucker.co.uk Date of publication 2012 Use in article (WP:NFCC#7) Following Sea Purpose of use in article (WP:NFCC#8) to serve as the primary means of visual identification at the top of the article dedicated to the work in question. Not replaceable with free media because (WP:NFCC#1) n.a. Minimal use (WP:NFCC#3) Low res image used in infobox of the article on the album Respect for commercial opportunities (WP:NFCC#2) n.a. Fair use Fair use of co
                      Read more