Proof for divisibility of polynomials. [on hold] The 2019 Stack Overflow Developer Survey Results Are InShow that $a^p^n=amod p$Divisibility problemPolynomial divisibility proofPolynomials and Divisibility Rule.Induction proof, divisibilityDivisibility of a polynomial by another polynomialDoes there exist a polynomial $f(x)$ with real coefficients such that $f(x)^2$ has fewer nonzero coefficients than $f(x)$?Polynomials - Relation of DivisibilityProof using concept of polynomials.Proof of Existence of A Rational Polynomial which has Irrational Root for an EquationTricky problem of infinite harmonic sum of polynomials

Falsification in Math vs Science

Does duplicating a spell with Wish count as casting that spell?

Pristine Bit Checking

Extreme, unacceptable situation and I can't attend work tomorrow morning

What spell level should this homebrew After-Image spell be?

Spanish for "widget"

Is there a name of the flying bionic bird?

Limit the amount of RAM Mathematica may access?

Why isn't airport relocation done gradually?

How to deal with fear of taking dependencies

Does light intensity oscillate really fast since it is a wave?

How are circuits which use complex ICs normally simulated?

Why do UK politicians seemingly ignore opinion polls on Brexit?

Where to refill my bottle in India?

Unbreakable Formation vs. Cry of the Carnarium

Inflated grade on resume at previous job, might former employer tell new employer?

How to answer pointed "are you quitting" questioning when I don't want them to suspect

Why don't Unix/Linux systems traverse through directories until they find the required version of a linked library?

Does it makes sense to buy a new cycle to learn riding?

How to make payment on the internet without leaving a money trail?

What does Linus Torvalds mean when he says that Git "never ever" tracks a file?

On the insanity of kings as an argument against monarchy

Monty Hall variation

Access elements in std::string where positon of string is greater than its size



Proof for divisibility of polynomials. [on hold]



The 2019 Stack Overflow Developer Survey Results Are InShow that $a^p^n=amod p$Divisibility problemPolynomial divisibility proofPolynomials and Divisibility Rule.Induction proof, divisibilityDivisibility of a polynomial by another polynomialDoes there exist a polynomial $f(x)$ with real coefficients such that $f(x)^2$ has fewer nonzero coefficients than $f(x)$?Polynomials - Relation of DivisibilityProof using concept of polynomials.Proof of Existence of A Rational Polynomial which has Irrational Root for an EquationTricky problem of infinite harmonic sum of polynomials










2












$begingroup$


I have no idea how to proceed with the following question. Please help!



"Prove that for any polynomial $ P(x) $ with real coefficients, other than polynomial $x$, the polynomial $ P(P(P(x))) − x $ is divisible by $ P(x) − x $."










share|cite|improve this question







New contributor




HeetGorakhiya is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$



put on hold as off-topic by José Carlos Santos, Sil, John Omielan, TheSimpliFire, RRL 2 days ago


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Sil, John Omielan, TheSimpliFire, RRL
If this question can be reworded to fit the rules in the help center, please edit the question.




















    2












    $begingroup$


    I have no idea how to proceed with the following question. Please help!



    "Prove that for any polynomial $ P(x) $ with real coefficients, other than polynomial $x$, the polynomial $ P(P(P(x))) − x $ is divisible by $ P(x) − x $."










    share|cite|improve this question







    New contributor




    HeetGorakhiya is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$



    put on hold as off-topic by José Carlos Santos, Sil, John Omielan, TheSimpliFire, RRL 2 days ago


    This question appears to be off-topic. The users who voted to close gave this specific reason:


    • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Sil, John Omielan, TheSimpliFire, RRL
    If this question can be reworded to fit the rules in the help center, please edit the question.


















      2












      2








      2





      $begingroup$


      I have no idea how to proceed with the following question. Please help!



      "Prove that for any polynomial $ P(x) $ with real coefficients, other than polynomial $x$, the polynomial $ P(P(P(x))) − x $ is divisible by $ P(x) − x $."










      share|cite|improve this question







      New contributor




      HeetGorakhiya is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      I have no idea how to proceed with the following question. Please help!



      "Prove that for any polynomial $ P(x) $ with real coefficients, other than polynomial $x$, the polynomial $ P(P(P(x))) − x $ is divisible by $ P(x) − x $."







      polynomials divisibility






      share|cite|improve this question







      New contributor




      HeetGorakhiya is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|cite|improve this question







      New contributor




      HeetGorakhiya is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|cite|improve this question




      share|cite|improve this question






      New contributor




      HeetGorakhiya is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 2 days ago









      HeetGorakhiyaHeetGorakhiya

      283




      283




      New contributor




      HeetGorakhiya is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      HeetGorakhiya is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      HeetGorakhiya is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.




      put on hold as off-topic by José Carlos Santos, Sil, John Omielan, TheSimpliFire, RRL 2 days ago


      This question appears to be off-topic. The users who voted to close gave this specific reason:


      • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Sil, John Omielan, TheSimpliFire, RRL
      If this question can be reworded to fit the rules in the help center, please edit the question.







      put on hold as off-topic by José Carlos Santos, Sil, John Omielan, TheSimpliFire, RRL 2 days ago


      This question appears to be off-topic. The users who voted to close gave this specific reason:


      • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Sil, John Omielan, TheSimpliFire, RRL
      If this question can be reworded to fit the rules in the help center, please edit the question.




















          2 Answers
          2






          active

          oldest

          votes


















          4












          $begingroup$

          Remember that $$a-bmid P(a)-P(b)$$



          so $$P(x)-xmid P(P(x))-P(x)$$ and thus $$P(x)-xmid (P(P(x))-P(x))+ (P(x)-x)$$



          so $$P(x)-xmid P(P(x))-xmid P(P(P(x)))-P(x)$$



          and thus $$P(x)-xmid (P(P(P(x)))-P(x))+ (P(x)-x)$$



          and finaly we have $$P(x)-xmid P(P(P(x)))-x$$






          share|cite|improve this answer











          $endgroup$








          • 1




            $begingroup$
            Modular arithmetic was invented to clarify proofs like this where the divisibilty relation greatly obfuscates the algebraic (operational) essence of the matter - here the simple notion of a fixed point - see my answer.
            $endgroup$
            – Bill Dubuque
            2 days ago



















          4












          $begingroup$

          $bmod P(x)!-!x!:, color#c00P(x)equiv x,Rightarrow, P(P(color#c00P(x)))equiv P(P(color#c00x)))equiv P(x)equiv x$



          Remark $ $ The proof is a special case of: fixed points stay fixed on iteration by induction,



          namely: $, $ if $ color#c00f(x) = x $ then $, f^large n(x) = x,Rightarrow, f^large n+1(x) = f^n(color#c00f(x))=f^n(color#c00x)=x$



          Corollary $ P(x)!-!x,$ divides $, P^n(x)!-!x,$ for all $,ninBbb N,,$ and all polynomials $,P(x)$






          share|cite|improve this answer











          $endgroup$



















            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            4












            $begingroup$

            Remember that $$a-bmid P(a)-P(b)$$



            so $$P(x)-xmid P(P(x))-P(x)$$ and thus $$P(x)-xmid (P(P(x))-P(x))+ (P(x)-x)$$



            so $$P(x)-xmid P(P(x))-xmid P(P(P(x)))-P(x)$$



            and thus $$P(x)-xmid (P(P(P(x)))-P(x))+ (P(x)-x)$$



            and finaly we have $$P(x)-xmid P(P(P(x)))-x$$






            share|cite|improve this answer











            $endgroup$








            • 1




              $begingroup$
              Modular arithmetic was invented to clarify proofs like this where the divisibilty relation greatly obfuscates the algebraic (operational) essence of the matter - here the simple notion of a fixed point - see my answer.
              $endgroup$
              – Bill Dubuque
              2 days ago
















            4












            $begingroup$

            Remember that $$a-bmid P(a)-P(b)$$



            so $$P(x)-xmid P(P(x))-P(x)$$ and thus $$P(x)-xmid (P(P(x))-P(x))+ (P(x)-x)$$



            so $$P(x)-xmid P(P(x))-xmid P(P(P(x)))-P(x)$$



            and thus $$P(x)-xmid (P(P(P(x)))-P(x))+ (P(x)-x)$$



            and finaly we have $$P(x)-xmid P(P(P(x)))-x$$






            share|cite|improve this answer











            $endgroup$








            • 1




              $begingroup$
              Modular arithmetic was invented to clarify proofs like this where the divisibilty relation greatly obfuscates the algebraic (operational) essence of the matter - here the simple notion of a fixed point - see my answer.
              $endgroup$
              – Bill Dubuque
              2 days ago














            4












            4








            4





            $begingroup$

            Remember that $$a-bmid P(a)-P(b)$$



            so $$P(x)-xmid P(P(x))-P(x)$$ and thus $$P(x)-xmid (P(P(x))-P(x))+ (P(x)-x)$$



            so $$P(x)-xmid P(P(x))-xmid P(P(P(x)))-P(x)$$



            and thus $$P(x)-xmid (P(P(P(x)))-P(x))+ (P(x)-x)$$



            and finaly we have $$P(x)-xmid P(P(P(x)))-x$$






            share|cite|improve this answer











            $endgroup$



            Remember that $$a-bmid P(a)-P(b)$$



            so $$P(x)-xmid P(P(x))-P(x)$$ and thus $$P(x)-xmid (P(P(x))-P(x))+ (P(x)-x)$$



            so $$P(x)-xmid P(P(x))-xmid P(P(P(x)))-P(x)$$



            and thus $$P(x)-xmid (P(P(P(x)))-P(x))+ (P(x)-x)$$



            and finaly we have $$P(x)-xmid P(P(P(x)))-x$$







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited 2 days ago

























            answered 2 days ago









            Maria MazurMaria Mazur

            49.9k1361125




            49.9k1361125







            • 1




              $begingroup$
              Modular arithmetic was invented to clarify proofs like this where the divisibilty relation greatly obfuscates the algebraic (operational) essence of the matter - here the simple notion of a fixed point - see my answer.
              $endgroup$
              – Bill Dubuque
              2 days ago













            • 1




              $begingroup$
              Modular arithmetic was invented to clarify proofs like this where the divisibilty relation greatly obfuscates the algebraic (operational) essence of the matter - here the simple notion of a fixed point - see my answer.
              $endgroup$
              – Bill Dubuque
              2 days ago








            1




            1




            $begingroup$
            Modular arithmetic was invented to clarify proofs like this where the divisibilty relation greatly obfuscates the algebraic (operational) essence of the matter - here the simple notion of a fixed point - see my answer.
            $endgroup$
            – Bill Dubuque
            2 days ago





            $begingroup$
            Modular arithmetic was invented to clarify proofs like this where the divisibilty relation greatly obfuscates the algebraic (operational) essence of the matter - here the simple notion of a fixed point - see my answer.
            $endgroup$
            – Bill Dubuque
            2 days ago












            4












            $begingroup$

            $bmod P(x)!-!x!:, color#c00P(x)equiv x,Rightarrow, P(P(color#c00P(x)))equiv P(P(color#c00x)))equiv P(x)equiv x$



            Remark $ $ The proof is a special case of: fixed points stay fixed on iteration by induction,



            namely: $, $ if $ color#c00f(x) = x $ then $, f^large n(x) = x,Rightarrow, f^large n+1(x) = f^n(color#c00f(x))=f^n(color#c00x)=x$



            Corollary $ P(x)!-!x,$ divides $, P^n(x)!-!x,$ for all $,ninBbb N,,$ and all polynomials $,P(x)$






            share|cite|improve this answer











            $endgroup$

















              4












              $begingroup$

              $bmod P(x)!-!x!:, color#c00P(x)equiv x,Rightarrow, P(P(color#c00P(x)))equiv P(P(color#c00x)))equiv P(x)equiv x$



              Remark $ $ The proof is a special case of: fixed points stay fixed on iteration by induction,



              namely: $, $ if $ color#c00f(x) = x $ then $, f^large n(x) = x,Rightarrow, f^large n+1(x) = f^n(color#c00f(x))=f^n(color#c00x)=x$



              Corollary $ P(x)!-!x,$ divides $, P^n(x)!-!x,$ for all $,ninBbb N,,$ and all polynomials $,P(x)$






              share|cite|improve this answer











              $endgroup$















                4












                4








                4





                $begingroup$

                $bmod P(x)!-!x!:, color#c00P(x)equiv x,Rightarrow, P(P(color#c00P(x)))equiv P(P(color#c00x)))equiv P(x)equiv x$



                Remark $ $ The proof is a special case of: fixed points stay fixed on iteration by induction,



                namely: $, $ if $ color#c00f(x) = x $ then $, f^large n(x) = x,Rightarrow, f^large n+1(x) = f^n(color#c00f(x))=f^n(color#c00x)=x$



                Corollary $ P(x)!-!x,$ divides $, P^n(x)!-!x,$ for all $,ninBbb N,,$ and all polynomials $,P(x)$






                share|cite|improve this answer











                $endgroup$



                $bmod P(x)!-!x!:, color#c00P(x)equiv x,Rightarrow, P(P(color#c00P(x)))equiv P(P(color#c00x)))equiv P(x)equiv x$



                Remark $ $ The proof is a special case of: fixed points stay fixed on iteration by induction,



                namely: $, $ if $ color#c00f(x) = x $ then $, f^large n(x) = x,Rightarrow, f^large n+1(x) = f^n(color#c00f(x))=f^n(color#c00x)=x$



                Corollary $ P(x)!-!x,$ divides $, P^n(x)!-!x,$ for all $,ninBbb N,,$ and all polynomials $,P(x)$







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited 2 days ago

























                answered 2 days ago









                Bill DubuqueBill Dubuque

                214k29196656




                214k29196656













                    -divisibility, polynomials

                    Popular posts from this blog

                    Frič See also Navigation menuinternal link

                    Identify plant with long narrow paired leaves and reddish stems Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?What is this plant with long sharp leaves? Is it a weed?What is this 3ft high, stalky plant, with mid sized narrow leaves?What is this young shrub with opposite ovate, crenate leaves and reddish stems?What is this plant with large broad serrated leaves?Identify this upright branching weed with long leaves and reddish stemsPlease help me identify this bulbous plant with long, broad leaves and white flowersWhat is this small annual with narrow gray/green leaves and rust colored daisy-type flowers?What is this chilli plant?Does anyone know what type of chilli plant this is?Help identify this plant

                    fontconfig warning: “/etc/fonts/fonts.conf”, line 100: unknown “element blank” The 2019 Stack Overflow Developer Survey Results Are In“tar: unrecognized option --warning” during 'apt-get install'How to fix Fontconfig errorHow do I figure out which font file is chosen for a system generic font alias?Why are some apt-get-installed fonts being ignored by fc-list, xfontsel, etc?Reload settings in /etc/fonts/conf.dTaking 30 seconds longer to boot after upgrade from jessie to stretchHow to match multiple font names with a single <match> element?Adding a custom font to fontconfigRemoving fonts from fontconfig <match> resultsBroken fonts after upgrading Firefox ESR to latest Firefox