Intereting Posts

Integral related to $\sum\limits_{n=1}^\infty\sin^n(x)\cos^n(x)$
Getting at least $k$ heads in a row $l$ times over after at most $m$ flips.
A continuous bijection from the Cantor Set to
Closed form expressions for harmonic sums
What is $iav-\log(v)$? Any series expansion or inequality for it?
How many ways are there to arrange the letters in the word “mississippi” such that all “p” precede all “i”?
Greatest number of planes we can get when dividing with lines and circles
Number of rooted subtrees of given size in infinite d-regular tree
Prove that $\liminf x_n = -\limsup (-x_n)$
Find conditions on positive integers so that $\sqrt{a}+\sqrt{b}+\sqrt{c}$ is irrational
Free product of groups as coproduct
Why is $A^TA$ invertible if $A$ has independent columns?
Dimension of the sum of subspaces
Homotopy equivalence of universal cover
Integral domain with two elements that do not have a gcd

Can someone please show me how to:

Find all polynomials $P(x)$ such that $P(x^2+2x+3)=[P(x+3)]^2$?

I’ve tried substitiuting $x=0,1$. Can’t seem to figure it out. The square on the RHS is confusing me. Thanks.

- Is there a name for function with the exponential property $f(x+y)=f(x) \cdot f(y)$?
- Suppose a function $f : \mathbb{R}\rightarrow \mathbb{R}$ satisfies $f(f(f(x)))=x$ for all $x$ belonging to $\mathbb{R}$.
- Functional equation: $f(f(x))=k$
- Prove that if a particular function is measurable, then its image is a rect line
- Functional Equation : If $(x-y)f(x+y) -(x+y)f(x-y) =4xy(x^2-y^2)$ for all x,y find f(x).
- Proving that an additive function $f$ is continuous if it is continuous at a single point

(P.S. I’m not that familiar with questions of this type)

- Quadratic Polynomial factorization
- How to prove “eigenvalues of polynomial of matrix $A$ = polynomial of eigenvalues of matrix $A$ ”
- Is a linear factor more likely than a quadratic factor?
- Question about Axler's proof that every linear operator has an eigenvalue
- The roots of $t^5+1$
- Chebyshev's Theorem regarding real polynomials: Why do only the Chebyshev polynomials achieve equality in this inequality?
- Polynomial GCD in the presence of floating-point errors
- Number of real roots of $\frac{a_1}{a_1-x}+\frac{a_2}{a_2-x}+…+\frac{a_n}{a_n-x}=2016$ for $0<a_1<…<a_n$?
- Prove that $n^{30}-n^{14}-n^{18}+n^2$ is divisible by $46410$
- What is the algorithm for long division of polynomials with multiple variables?

Let $Q(x) = P(x+2)$ and $y = x + 1$, we have:

$$Q(y^2) = P(y^2+2) = P(x^2+2x+3) = P(x+3)^2 = Q(y)^2$$

It is then clear $Q(y) = y^n \Leftrightarrow P(x) = (x-2)^n, n \in \mathbb{N}$

is an obvious family of solutions for the functional equation.

By brute force matching of coefficients, it is easy to check for small $n$

(I have checked up to $n = 3$), this is the only solution for $P$ with degree $n$.

Let use prove that this is indeed the case.

Let $Q_1(y), Q_2(y)$ be two polynomial solutions of degree $n > 1$ for the functional equation:

$$Q(y^2) = Q(y)^2\tag{*}$$

By comparing the leading coefficients of $Q_1(y)$ and $Q_2(y)$, we know both of them are monic. This means their difference $U(y) = Q_1(y) – Q_2(y)$ is a polynomial of degree

at most $n-1$. If $U(y)$ is not identically zero, then by comparing degrees on both sides of:

$$U(y^2) = Q_1(y^2) – Q_2(y^2) = U(y)(Q_1(y) + Q_2(y))$$

We get a contradiction that $2 \deg{U} = \deg{U} + n \Leftrightarrow \deg{U} = n$.

From this, we can conclude $Q(y) = y^n \Leftrightarrow P(x) = (x-2)^n$ is the only solution of degree $n$ for corresponding functional equations.

**UPDATE** *Related mathematical topics*

Let $R(y)$ be the polynomial $y^2$, the functional equation $(*)$ can be rewritten as:

$$Q\circ R = R\circ Q$$

i.e. the two polynomials $Q$ and $R$ commute under functional composition. There is

a classification theorem which will help us to attack this type of functional equation involving commuting pair of polynomials.

First we need to define the concept of equivalence between 2 pairs of polynomials.

Let $(f_1, g_1)$ and $(f_2, g_2)$ be any two pairs of polynomials, we will call them

equivalent if we can find a linear polynomial $l(x) = ax + b, a \ne 0$ such that:

$$f_1 = l^{-1} \circ f_2 \circ l \quad\text{ and }\quad g_1 = l^{-1} \circ g_2 \circ l$$

In 1922, Ritt proved following theorem:

Let $f$ and $g$ be commuting polynomials. Then the pair $(f,g)$ is

equivalent to one of the following pairs:

- $x^m$ and $\epsilon x^n$ where $\epsilon^{m-1} = 1$.
- $\pm T_m(x)$ and $\pm T_n(x)$, where $T_m$ and $T_n$ are Chebyshev polynomials.
- $\epsilon_1 h^{\circ k}(x)$ and $\epsilon_2 h^{\circ l}(x)$, where $\epsilon_1^q = \epsilon_2^q = 1$ and $h(x)$ is a polynomial of the

form $x H(x^q)$ and $h^{\circ 1} = h$, $h^{\circ 2} = h\circ h$,

$h^{\circ 3} = h \circ h \circ h$, and so on.

If you have two commuting polynomials $f$ and $g$, then aside from the trivial case where $f$ and $g$ are functional iterate of a single underlying polynomial $h$. then up to equivalence, $f$ and $g$ can only be simple powers $x^m$ or Chebyshev polynomials $T_m(x)$.

Apply this to our function equation $(*)$. $R$ has the form of a simple power $y^2$,

So $Q(y)$ itself have to be a simple power as we have proved above.

When $R$ is something more complicated, isn’t equivalent to a simple power or Chebyshev polynomial or functional iterate of other polynomial of $h$, then the only solution for

$Q$ are functional iterates $R^{\circ k}$ of $R$.

**References**

- Ritt’s paper Permutable rational functions
- V. Prasolov’s book Polynomials

- Proving $\cot(A)\cot(B)+\cot(B)\cot(C)+\cot(C)\cot(A)=1$
- Fractional Calculus: Motivation and Foundations.
- system of ode with non-constant coefficient matrix
- Relation between two Riemannain connections
- If $\lim_{h\to 0} \frac{f(x_0 + h) – f(x_0 – h)}{2h} = f'(x_0)$ exists, is f differentiable at $x_0$?
- Automorphism group of the Alternating Group – a proof
- Tricky (extremal?) combinatorics problem
- Is every normal subgroup of a finitely generated free group a normal closure of a finite set?
- Every finitely generated algebra over a field is a Jacobson ring
- Probability for the length of the longest run in $n$ Bernoulli trials
- Can $f(x)=|x|^3$ be differentiated
- Using induction to prove that $\sum_{r=1}^n r\cdot r! =(n+1)! -1$
- prove that $\frac{(2n)!}{(n!)^2}$ is even if $n$ is a positive integer
- More numbers between $$ or $[1,\infty)$?
- Use induction to prove that that $8^{n} | (4n)!$ for all positive integers $n$