Prove $x^n(y-z) + y^n(z-x) + z^n(x-y)$ is divisible by $(y-z)(z-x)(x-y)$

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
4
down vote

favorite
1












I have to show that $$P(x, y, z) = x^n(y-z) + y^n(z-x) + z^n(x-y)$$



is always divisible by $Q(x, y, z) = (y-z)(z-x)(x-y)$ for $n$ greater than $1$ and I have no idea how to proceed.



-> I would try to prove they have common roots but I don't even know what "to be a root" means on a problem like this so I tried to factor it and realized that this might not be the correct approach. Can someone help me ?







share|cite|improve this question


















  • 1




    $P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
    – Lord Shark the Unknown
    Aug 25 at 4:11






  • 3




    Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
    – Gerry Myerson
    Aug 25 at 4:20






  • 1




    So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
    – Leonardo V. Sailer
    Aug 25 at 4:25






  • 4




    No, this is not stupid question.
    – Takahiro Waki
    Aug 25 at 4:29














up vote
4
down vote

favorite
1












I have to show that $$P(x, y, z) = x^n(y-z) + y^n(z-x) + z^n(x-y)$$



is always divisible by $Q(x, y, z) = (y-z)(z-x)(x-y)$ for $n$ greater than $1$ and I have no idea how to proceed.



-> I would try to prove they have common roots but I don't even know what "to be a root" means on a problem like this so I tried to factor it and realized that this might not be the correct approach. Can someone help me ?







share|cite|improve this question


















  • 1




    $P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
    – Lord Shark the Unknown
    Aug 25 at 4:11






  • 3




    Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
    – Gerry Myerson
    Aug 25 at 4:20






  • 1




    So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
    – Leonardo V. Sailer
    Aug 25 at 4:25






  • 4




    No, this is not stupid question.
    – Takahiro Waki
    Aug 25 at 4:29












up vote
4
down vote

favorite
1









up vote
4
down vote

favorite
1






1





I have to show that $$P(x, y, z) = x^n(y-z) + y^n(z-x) + z^n(x-y)$$



is always divisible by $Q(x, y, z) = (y-z)(z-x)(x-y)$ for $n$ greater than $1$ and I have no idea how to proceed.



-> I would try to prove they have common roots but I don't even know what "to be a root" means on a problem like this so I tried to factor it and realized that this might not be the correct approach. Can someone help me ?







share|cite|improve this question














I have to show that $$P(x, y, z) = x^n(y-z) + y^n(z-x) + z^n(x-y)$$



is always divisible by $Q(x, y, z) = (y-z)(z-x)(x-y)$ for $n$ greater than $1$ and I have no idea how to proceed.



-> I would try to prove they have common roots but I don't even know what "to be a root" means on a problem like this so I tried to factor it and realized that this might not be the correct approach. Can someone help me ?









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 25 at 5:11









Brahadeesh

4,13831550




4,13831550










asked Aug 25 at 4:08









Leonardo V. Sailer

285




285







  • 1




    $P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
    – Lord Shark the Unknown
    Aug 25 at 4:11






  • 3




    Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
    – Gerry Myerson
    Aug 25 at 4:20






  • 1




    So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
    – Leonardo V. Sailer
    Aug 25 at 4:25






  • 4




    No, this is not stupid question.
    – Takahiro Waki
    Aug 25 at 4:29












  • 1




    $P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
    – Lord Shark the Unknown
    Aug 25 at 4:11






  • 3




    Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
    – Gerry Myerson
    Aug 25 at 4:20






  • 1




    So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
    – Leonardo V. Sailer
    Aug 25 at 4:25






  • 4




    No, this is not stupid question.
    – Takahiro Waki
    Aug 25 at 4:29







1




1




$P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
– Lord Shark the Unknown
Aug 25 at 4:11




$P$ is a alternating function: $P(x,y,z)=-P(y,x,z)=-P(x,z,y)$ etc.
– Lord Shark the Unknown
Aug 25 at 4:11




3




3




Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
– Gerry Myerson
Aug 25 at 4:20




Can you show $P$ is divisible by $y-z$, Leonardo? by doing some simple algebraic manipulations, perhaps?
– Gerry Myerson
Aug 25 at 4:20




1




1




So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
– Leonardo V. Sailer
Aug 25 at 4:25




So it works just like one variable polynomials ? I show it is divisible by each irreducible factor ? If the answer is yes, my question was really stupid.
– Leonardo V. Sailer
Aug 25 at 4:25




4




4




No, this is not stupid question.
– Takahiro Waki
Aug 25 at 4:29




No, this is not stupid question.
– Takahiro Waki
Aug 25 at 4:29










4 Answers
4






active

oldest

votes

















up vote
3
down vote



accepted










Basic idea: If you let $Q(x,y,z) = P(x,y,z+ x)$, then you can verify directly that $Q(x,y,0) = 0$, which means $z$ factors $Q(x,y,z)$. In other words $Q(x,y,z) = zR(x,y,z)$ for some
polynomial $R(x,y,z)$. Hence $P(x,y,z) = Q(x,y,z-x) = (z - x)R(x,y,z-x)$. Thus
$P(x,y,z)$ has $z- x$ as a factor.



You can do the analogous steps to get the other two factors.






share|cite|improve this answer



























    up vote
    3
    down vote













    Note that it suffices to show that $P(x,y,z)$ is divisible by each of the three factors $(x-y)$, $(y-z)$, and $(z-x)$. However, justifying this properly requires the theory of Unique Factorization Domains, which is possibly outside the scope of the question.



    One alternative path is to proceed by direct factoring. This starts as follows:
    $$
    beginalign* Q(x,y,z) & = x^n(y-z) + y^n(z-x) + z^n(x-y) \
    & = xy(x^n-1-y^n-1) + z(y^n-x^n)+z^n(x-y) \
    & = (x-y)(xy(x^n-2+yx^n-3+ldots+y^n-2)
    -z(y^n-1+xy^n-2+ldots+x^n-1)+z^n);. \
    endalign*
    $$
    The next step is to explicitly factor $(xy(x^n-2+yx^n-3+ldots+y^n-2)
    -z(y^n-1+xy^n-2+ldots+x^n-1)+z^n$ as $(y-z)R(x,y,z)$, and so on. Doing this is looks like a very messy exercise, but it ends up with the following nice form:
    $$
    Q(x,y,z) = -(x-y)(y-z)(z-x)left(sum_i+j+k=n-2x^iy^jz^kright);.
    $$
    Verifying that this multiplies out to $Q(x,y,z)$ is probably more elegant than the above direct factorization, but does require some care.






    share|cite|improve this answer
















    • 1




      Thanks for your nice answer! Really appreciate it.
      – Leonardo V. Sailer
      Aug 25 at 5:18

















    up vote
    2
    down vote













    Hint: You can think $P(x,y,z)$ as a polynomial in $y$ , then see that $P(x,z,z)=0$. This means, $(y-z)$ divides $P(x,y,z)$, as we have done for polynomials in one variable. Similarly think about $P(y,y,z)$ and $P(z,y,z)$.






    share|cite|improve this answer




















    • I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
      – Leonardo V. Sailer
      Aug 25 at 5:01

















    up vote
    0
    down vote













    If at least 2 of the $x,y,z$ are equal then it is obvious. Eitherwise, You can consider $P$ as a polynomial of $x$ first and see that for $x=y,z$ we get $P=0$, so $$P=(x-y)(x-z)Q (1)$$, where $Q$ is a polynomial of $x$ with $z,y$ as parameters. Now consider $P$ as a polynomial of $z$. For $z=y$, we get again $P=0$, The last one due to $(1)$ leads to the fact that $Q(y)=0$, and so $Q=(z-y)R$, if you consider again $Q$ as a polynomial now of $z$. This concludes the proof.






    share|cite|improve this answer




















      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: false,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      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%2f2893791%2fprove-xny-z-ynz-x-znx-y-is-divisible-by-y-zz-xx-y%23new-answer', 'question_page');

      );

      Post as a guest






























      4 Answers
      4






      active

      oldest

      votes








      4 Answers
      4






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      3
      down vote



      accepted










      Basic idea: If you let $Q(x,y,z) = P(x,y,z+ x)$, then you can verify directly that $Q(x,y,0) = 0$, which means $z$ factors $Q(x,y,z)$. In other words $Q(x,y,z) = zR(x,y,z)$ for some
      polynomial $R(x,y,z)$. Hence $P(x,y,z) = Q(x,y,z-x) = (z - x)R(x,y,z-x)$. Thus
      $P(x,y,z)$ has $z- x$ as a factor.



      You can do the analogous steps to get the other two factors.






      share|cite|improve this answer
























        up vote
        3
        down vote



        accepted










        Basic idea: If you let $Q(x,y,z) = P(x,y,z+ x)$, then you can verify directly that $Q(x,y,0) = 0$, which means $z$ factors $Q(x,y,z)$. In other words $Q(x,y,z) = zR(x,y,z)$ for some
        polynomial $R(x,y,z)$. Hence $P(x,y,z) = Q(x,y,z-x) = (z - x)R(x,y,z-x)$. Thus
        $P(x,y,z)$ has $z- x$ as a factor.



        You can do the analogous steps to get the other two factors.






        share|cite|improve this answer






















          up vote
          3
          down vote



          accepted







          up vote
          3
          down vote



          accepted






          Basic idea: If you let $Q(x,y,z) = P(x,y,z+ x)$, then you can verify directly that $Q(x,y,0) = 0$, which means $z$ factors $Q(x,y,z)$. In other words $Q(x,y,z) = zR(x,y,z)$ for some
          polynomial $R(x,y,z)$. Hence $P(x,y,z) = Q(x,y,z-x) = (z - x)R(x,y,z-x)$. Thus
          $P(x,y,z)$ has $z- x$ as a factor.



          You can do the analogous steps to get the other two factors.






          share|cite|improve this answer












          Basic idea: If you let $Q(x,y,z) = P(x,y,z+ x)$, then you can verify directly that $Q(x,y,0) = 0$, which means $z$ factors $Q(x,y,z)$. In other words $Q(x,y,z) = zR(x,y,z)$ for some
          polynomial $R(x,y,z)$. Hence $P(x,y,z) = Q(x,y,z-x) = (z - x)R(x,y,z-x)$. Thus
          $P(x,y,z)$ has $z- x$ as a factor.



          You can do the analogous steps to get the other two factors.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Aug 25 at 4:56









          Zarrax

          34.8k248102




          34.8k248102




















              up vote
              3
              down vote













              Note that it suffices to show that $P(x,y,z)$ is divisible by each of the three factors $(x-y)$, $(y-z)$, and $(z-x)$. However, justifying this properly requires the theory of Unique Factorization Domains, which is possibly outside the scope of the question.



              One alternative path is to proceed by direct factoring. This starts as follows:
              $$
              beginalign* Q(x,y,z) & = x^n(y-z) + y^n(z-x) + z^n(x-y) \
              & = xy(x^n-1-y^n-1) + z(y^n-x^n)+z^n(x-y) \
              & = (x-y)(xy(x^n-2+yx^n-3+ldots+y^n-2)
              -z(y^n-1+xy^n-2+ldots+x^n-1)+z^n);. \
              endalign*
              $$
              The next step is to explicitly factor $(xy(x^n-2+yx^n-3+ldots+y^n-2)
              -z(y^n-1+xy^n-2+ldots+x^n-1)+z^n$ as $(y-z)R(x,y,z)$, and so on. Doing this is looks like a very messy exercise, but it ends up with the following nice form:
              $$
              Q(x,y,z) = -(x-y)(y-z)(z-x)left(sum_i+j+k=n-2x^iy^jz^kright);.
              $$
              Verifying that this multiplies out to $Q(x,y,z)$ is probably more elegant than the above direct factorization, but does require some care.






              share|cite|improve this answer
















              • 1




                Thanks for your nice answer! Really appreciate it.
                – Leonardo V. Sailer
                Aug 25 at 5:18














              up vote
              3
              down vote













              Note that it suffices to show that $P(x,y,z)$ is divisible by each of the three factors $(x-y)$, $(y-z)$, and $(z-x)$. However, justifying this properly requires the theory of Unique Factorization Domains, which is possibly outside the scope of the question.



              One alternative path is to proceed by direct factoring. This starts as follows:
              $$
              beginalign* Q(x,y,z) & = x^n(y-z) + y^n(z-x) + z^n(x-y) \
              & = xy(x^n-1-y^n-1) + z(y^n-x^n)+z^n(x-y) \
              & = (x-y)(xy(x^n-2+yx^n-3+ldots+y^n-2)
              -z(y^n-1+xy^n-2+ldots+x^n-1)+z^n);. \
              endalign*
              $$
              The next step is to explicitly factor $(xy(x^n-2+yx^n-3+ldots+y^n-2)
              -z(y^n-1+xy^n-2+ldots+x^n-1)+z^n$ as $(y-z)R(x,y,z)$, and so on. Doing this is looks like a very messy exercise, but it ends up with the following nice form:
              $$
              Q(x,y,z) = -(x-y)(y-z)(z-x)left(sum_i+j+k=n-2x^iy^jz^kright);.
              $$
              Verifying that this multiplies out to $Q(x,y,z)$ is probably more elegant than the above direct factorization, but does require some care.






              share|cite|improve this answer
















              • 1




                Thanks for your nice answer! Really appreciate it.
                – Leonardo V. Sailer
                Aug 25 at 5:18












              up vote
              3
              down vote










              up vote
              3
              down vote









              Note that it suffices to show that $P(x,y,z)$ is divisible by each of the three factors $(x-y)$, $(y-z)$, and $(z-x)$. However, justifying this properly requires the theory of Unique Factorization Domains, which is possibly outside the scope of the question.



              One alternative path is to proceed by direct factoring. This starts as follows:
              $$
              beginalign* Q(x,y,z) & = x^n(y-z) + y^n(z-x) + z^n(x-y) \
              & = xy(x^n-1-y^n-1) + z(y^n-x^n)+z^n(x-y) \
              & = (x-y)(xy(x^n-2+yx^n-3+ldots+y^n-2)
              -z(y^n-1+xy^n-2+ldots+x^n-1)+z^n);. \
              endalign*
              $$
              The next step is to explicitly factor $(xy(x^n-2+yx^n-3+ldots+y^n-2)
              -z(y^n-1+xy^n-2+ldots+x^n-1)+z^n$ as $(y-z)R(x,y,z)$, and so on. Doing this is looks like a very messy exercise, but it ends up with the following nice form:
              $$
              Q(x,y,z) = -(x-y)(y-z)(z-x)left(sum_i+j+k=n-2x^iy^jz^kright);.
              $$
              Verifying that this multiplies out to $Q(x,y,z)$ is probably more elegant than the above direct factorization, but does require some care.






              share|cite|improve this answer












              Note that it suffices to show that $P(x,y,z)$ is divisible by each of the three factors $(x-y)$, $(y-z)$, and $(z-x)$. However, justifying this properly requires the theory of Unique Factorization Domains, which is possibly outside the scope of the question.



              One alternative path is to proceed by direct factoring. This starts as follows:
              $$
              beginalign* Q(x,y,z) & = x^n(y-z) + y^n(z-x) + z^n(x-y) \
              & = xy(x^n-1-y^n-1) + z(y^n-x^n)+z^n(x-y) \
              & = (x-y)(xy(x^n-2+yx^n-3+ldots+y^n-2)
              -z(y^n-1+xy^n-2+ldots+x^n-1)+z^n);. \
              endalign*
              $$
              The next step is to explicitly factor $(xy(x^n-2+yx^n-3+ldots+y^n-2)
              -z(y^n-1+xy^n-2+ldots+x^n-1)+z^n$ as $(y-z)R(x,y,z)$, and so on. Doing this is looks like a very messy exercise, but it ends up with the following nice form:
              $$
              Q(x,y,z) = -(x-y)(y-z)(z-x)left(sum_i+j+k=n-2x^iy^jz^kright);.
              $$
              Verifying that this multiplies out to $Q(x,y,z)$ is probably more elegant than the above direct factorization, but does require some care.







              share|cite|improve this answer












              share|cite|improve this answer



              share|cite|improve this answer










              answered Aug 25 at 5:07









              Rolf Hoyer

              10.6k31629




              10.6k31629







              • 1




                Thanks for your nice answer! Really appreciate it.
                – Leonardo V. Sailer
                Aug 25 at 5:18












              • 1




                Thanks for your nice answer! Really appreciate it.
                – Leonardo V. Sailer
                Aug 25 at 5:18







              1




              1




              Thanks for your nice answer! Really appreciate it.
              – Leonardo V. Sailer
              Aug 25 at 5:18




              Thanks for your nice answer! Really appreciate it.
              – Leonardo V. Sailer
              Aug 25 at 5:18










              up vote
              2
              down vote













              Hint: You can think $P(x,y,z)$ as a polynomial in $y$ , then see that $P(x,z,z)=0$. This means, $(y-z)$ divides $P(x,y,z)$, as we have done for polynomials in one variable. Similarly think about $P(y,y,z)$ and $P(z,y,z)$.






              share|cite|improve this answer




















              • I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
                – Leonardo V. Sailer
                Aug 25 at 5:01














              up vote
              2
              down vote













              Hint: You can think $P(x,y,z)$ as a polynomial in $y$ , then see that $P(x,z,z)=0$. This means, $(y-z)$ divides $P(x,y,z)$, as we have done for polynomials in one variable. Similarly think about $P(y,y,z)$ and $P(z,y,z)$.






              share|cite|improve this answer




















              • I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
                – Leonardo V. Sailer
                Aug 25 at 5:01












              up vote
              2
              down vote










              up vote
              2
              down vote









              Hint: You can think $P(x,y,z)$ as a polynomial in $y$ , then see that $P(x,z,z)=0$. This means, $(y-z)$ divides $P(x,y,z)$, as we have done for polynomials in one variable. Similarly think about $P(y,y,z)$ and $P(z,y,z)$.






              share|cite|improve this answer












              Hint: You can think $P(x,y,z)$ as a polynomial in $y$ , then see that $P(x,z,z)=0$. This means, $(y-z)$ divides $P(x,y,z)$, as we have done for polynomials in one variable. Similarly think about $P(y,y,z)$ and $P(z,y,z)$.







              share|cite|improve this answer












              share|cite|improve this answer



              share|cite|improve this answer










              answered Aug 25 at 4:40









              tarit goswami

              1,127119




              1,127119











              • I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
                – Leonardo V. Sailer
                Aug 25 at 5:01
















              • I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
                – Leonardo V. Sailer
                Aug 25 at 5:01















              I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
              – Leonardo V. Sailer
              Aug 25 at 5:01




              I was overcomplicating it. I didn't know if those were sufficient conditions. Thanks for explaing it to me.
              – Leonardo V. Sailer
              Aug 25 at 5:01










              up vote
              0
              down vote













              If at least 2 of the $x,y,z$ are equal then it is obvious. Eitherwise, You can consider $P$ as a polynomial of $x$ first and see that for $x=y,z$ we get $P=0$, so $$P=(x-y)(x-z)Q (1)$$, where $Q$ is a polynomial of $x$ with $z,y$ as parameters. Now consider $P$ as a polynomial of $z$. For $z=y$, we get again $P=0$, The last one due to $(1)$ leads to the fact that $Q(y)=0$, and so $Q=(z-y)R$, if you consider again $Q$ as a polynomial now of $z$. This concludes the proof.






              share|cite|improve this answer
























                up vote
                0
                down vote













                If at least 2 of the $x,y,z$ are equal then it is obvious. Eitherwise, You can consider $P$ as a polynomial of $x$ first and see that for $x=y,z$ we get $P=0$, so $$P=(x-y)(x-z)Q (1)$$, where $Q$ is a polynomial of $x$ with $z,y$ as parameters. Now consider $P$ as a polynomial of $z$. For $z=y$, we get again $P=0$, The last one due to $(1)$ leads to the fact that $Q(y)=0$, and so $Q=(z-y)R$, if you consider again $Q$ as a polynomial now of $z$. This concludes the proof.






                share|cite|improve this answer






















                  up vote
                  0
                  down vote










                  up vote
                  0
                  down vote









                  If at least 2 of the $x,y,z$ are equal then it is obvious. Eitherwise, You can consider $P$ as a polynomial of $x$ first and see that for $x=y,z$ we get $P=0$, so $$P=(x-y)(x-z)Q (1)$$, where $Q$ is a polynomial of $x$ with $z,y$ as parameters. Now consider $P$ as a polynomial of $z$. For $z=y$, we get again $P=0$, The last one due to $(1)$ leads to the fact that $Q(y)=0$, and so $Q=(z-y)R$, if you consider again $Q$ as a polynomial now of $z$. This concludes the proof.






                  share|cite|improve this answer












                  If at least 2 of the $x,y,z$ are equal then it is obvious. Eitherwise, You can consider $P$ as a polynomial of $x$ first and see that for $x=y,z$ we get $P=0$, so $$P=(x-y)(x-z)Q (1)$$, where $Q$ is a polynomial of $x$ with $z,y$ as parameters. Now consider $P$ as a polynomial of $z$. For $z=y$, we get again $P=0$, The last one due to $(1)$ leads to the fact that $Q(y)=0$, and so $Q=(z-y)R$, if you consider again $Q$ as a polynomial now of $z$. This concludes the proof.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Aug 26 at 19:16









                  dmtri

                  768317




                  768317



























                       

                      draft saved


                      draft discarded















































                       


                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2893791%2fprove-xny-z-ynz-x-znx-y-is-divisible-by-y-zz-xx-y%23new-answer', 'question_page');

                      );

                      Post as a guest













































































                      這個網誌中的熱門文章

                      How to combine Bézier curves to a surface?

                      Carbon dioxide

                      Why am i infinitely getting the same tweet with the Twitter Search API?