Mryntu

Do Phineas and Ferb ever actually get busted in real time?

What do you call something that goes against the spirit of the law, but is legal when interpreting the law to the letter?

Is it possible to do 50 km distance without any previous training?

Are tax years 2016 & 2017 back taxes deductible for tax year 2018?

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

How is this relation reflexive?

Question about Goedel's incompleteness Proof

Pronouncing Dictionary.com's W.O.D "vade mecum" in English

Compute hash value according to multiplication method

Why is an old chain unsafe?

How did the USSR manage to innovate in an environment characterized by government censorship and high bureaucracy?

Shell script can be run only with sh command

What exactly is the parasitic white layer that forms after iron parts are treated with ammonia?

What makes Graph invariants so useful/important?

How is it possible for user to changed after storage was encrypted? (on OS X, Android)

What typically incentivizes a professor to change jobs to a lower ranking university?

How to type dʒ symbol (IPA) on Mac?

Email Account under attack (really) - anything I can do?

declaring a variable twice in IIFE

New order #4: World

Patience, young "Padovan"

whey we use polarized capacitor?

Prevent a directory in /tmp from being deleted

Is there really no realistic way for a skeleton monster to move around without magic?

Proof for divisibility of polynomials.

Show 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

0

$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 $."

polynomials divisibility

share|cite|improve this question

asked 5 hours ago

HeetGorakhiyaHeetGorakhiya

203

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$

add a comment | 

0

$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 $."

polynomials divisibility

share|cite|improve this question

asked 5 hours ago

HeetGorakhiyaHeetGorakhiya

203

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$

add a comment | 

$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 $."

polynomials divisibility

share|cite|improve this question

asked 5 hours ago

HeetGorakhiyaHeetGorakhiya

203

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$

share|cite|improve this question

asked 5 hours ago

HeetGorakhiyaHeetGorakhiya

203

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

asked 5 hours ago

HeetGorakhiyaHeetGorakhiya

203

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 5 hours ago

HeetGorakhiyaHeetGorakhiya

203

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 5 hours ago

HeetGorakhiyaHeetGorakhiya

203

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

edited 5 hours ago

answered 5 hours ago

Maria MazurMaria Mazur

50k1361124

$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
  5 hours ago
  
  

  
  
  
  

add a comment | 

3

$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

edited 5 hours ago

answered 5 hours ago

Bill DubuqueBill Dubuque

214k29196654

$endgroup$

add a comment | 

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
);



);

HeetGorakhiya is a new contributor. Be nice, and check out our Code of Conduct.

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3178582%2fproof-for-divisibility-of-polynomials%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

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

edited 5 hours ago

answered 5 hours ago

Maria MazurMaria Mazur

50k1361124

$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
  5 hours ago
  
  

  
  
  
  

add a comment | 

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

edited 5 hours ago

answered 5 hours ago

Maria MazurMaria Mazur

50k1361124

$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
  5 hours ago
  
  

  
  
  
  

add a comment | 

$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

edited 5 hours ago

answered 5 hours ago

Maria MazurMaria Mazur

50k1361124

$endgroup$

share|cite|improve this answer

edited 5 hours ago

answered 5 hours ago

Maria MazurMaria Mazur

50k1361124

answered 5 hours ago

Maria MazurMaria Mazur

50k1361124

answered 5 hours ago

Maria MazurMaria Mazur

50k1361124

3

$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

edited 5 hours ago

answered 5 hours ago

Bill DubuqueBill Dubuque

214k29196654

$endgroup$

add a comment | 

3

$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

edited 5 hours ago

answered 5 hours ago

Bill DubuqueBill Dubuque

214k29196654

$endgroup$

add a comment | 

$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

edited 5 hours ago

answered 5 hours ago

Bill DubuqueBill Dubuque

214k29196654

$endgroup$

share|cite|improve this answer

edited 5 hours ago

answered 5 hours ago

Bill DubuqueBill Dubuque

214k29196654

answered 5 hours ago

Bill DubuqueBill Dubuque

214k29196654

answered 5 hours ago

Bill DubuqueBill Dubuque

214k29196654