Maths Olympiad Prep

Track / Stage 6 / 386 of 400 #1386 of 1964

Problem 1386

National olympiad, first round
Algebra Difficulty 6.9 Find the answer

Find all polynomials p(x)p(x) with real coeffcients such that
p(a+b2c)+p(b+c2a)+p(c+a2b)=3p(ab)+3p(bc)+3p(ca)p(a + b - 2c) + p(b + c - 2a) + p(c + a - 2b) = 3p(a - b) + 3p(b - c) + 3p(c - a)
for all a,b,cRa, b, c\in\mathbb{R}.

[i](2nd Benelux Mathematical Olympiad 2010, Problem 2)[/i]

A number or a short expression. Spacing and $ signs are ignored.

Official solution

1. Substitution and Simplification:
We start by substituting x=ab x = a - b and y=bc y = b - c into the given equation:
p(a+b2c)+p(b+c2a)+p(c+a2b)=3p(ab)+3p(bc)+3p(ca) p(a + b - 2c) + p(b + c - 2a) + p(c + a - 2b) = 3p(a - b) + 3p(b - c) + 3p(c - a)
This transforms the equation into:
p(xy)+p(2xy)+p(x+2y)=3p(x)+3p(y)+3p(xy) p(x - y) + p(-2x - y) + p(x + 2y) = 3p(x) + 3p(y) + 3p(-x - y)

2. **Special Case x=y=0 x = y = 0 :**
Setting x=0 x = 0 and y=0 y = 0 in the transformed equation, we get:
p(0)+p(0)+p(0)=3p(0)+3p(0)+3p(0) p(0) + p(0) + p(0) = 3p(0) + 3p(0) + 3p(0)
Simplifying, we find:
3p(0)=9p(0)    p(0)=0 3p(0) = 9p(0) \implies p(0) = 0

3. **Special Case y=0 y = 0 :**
Setting y=0 y = 0 in the transformed equation, we get:
p(x)+p(2x)+p(x)=3p(x)+3p(x) p(x) + p(-2x) + p(x) = 3p(x) + 3p(-x)
Simplifying, we find:
2p(x)+p(2x)=3p(x)+3p(x)    p(2x)=p(x)+3p(x) 2p(x) + p(-2x) = 3p(x) + 3p(-x) \implies p(-2x) = p(x) + 3p(-x)

4. Assuming Polynomial Form:
Assume p(x) p(x) is a polynomial of degree n n :
p(x)=anxn+an1xn1++a1x+a0 p(x) = a_n x^n + a_{n-1} x^{n-1} + \cdots + a_1 x + a_0
Since p(0)=0 p(0) = 0 , we have a0=0 a_0 = 0 . Thus:
p(x)=anxn+an1xn1++a1x p(x) = a_n x^n + a_{n-1} x^{n-1} + \cdots + a_1 x

5. **Analyzing the Equation p(2x)=p(x)+3p(x) p(-2x) = p(x) + 3p(-x) :**
Substitute p(x)=anxn+an1xn1++a1x p(x) = a_n x^n + a_{n-1} x^{n-1} + \cdots + a_1 x into the equation:
an(2x)n+an1(2x)n1++a1(2x)=anxn+an1xn1++a1x+3(an(x)n+an1(x)n1++a1(x)) a_n (-2x)^n + a_{n-1} (-2x)^{n-1} + \cdots + a_1 (-2x) = a_n x^n + a_{n-1} x^{n-1} + \cdots + a_1 x + 3(a_n (-x)^n + a_{n-1} (-x)^{n-1} + \cdots + a_1 (-x))
Simplifying, we get:
an(2)nxn+an1(2)n1xn1++a1(2)x=anxn+an1xn1++a1x+3(an(1)nxn+an1(1)n1xn1++a1(1)x) a_n (-2)^n x^n + a_{n-1} (-2)^{n-1} x^{n-1} + \cdots + a_1 (-2) x = a_n x^n + a_{n-1} x^{n-1} + \cdots + a_1 x + 3(a_n (-1)^n x^n + a_{n-1} (-1)^{n-1} x^{n-1} + \cdots + a_1 (-1) x)

6. Equating Coefficients:
For each power of x x , we equate the coefficients:
ak(2)k=ak+3ak(1)k a_k (-2)^k = a_k + 3a_k (-1)^k
This simplifies to:
ak[(2)k13(1)k]=0 a_k \left[ (-2)^k - 1 - 3(-1)^k \right] = 0
This gives us two cases:
{ak(2k4)=0if k is evenak(2k2)=0if k is odd \begin{cases} a_k (2^k - 4) = 0 & \text{if } k \text{ is even} \\ a_k (2^k - 2) = 0 & \text{if } k \text{ is odd} \end{cases}

7. Solving for Coefficients:
For k3 k \geq 3 , both equations yield ak=0 a_k = 0 . Therefore, the polynomial p(x) p(x) must be of degree at most 2:
p(x)=λx2+μx p(x) = \lambda x^2 + \mu x
where λ \lambda and μ \mu are real constants.

8. Verification:
Substituting p(x)=λx2+μx p(x) = \lambda x^2 + \mu x back into the original equation, we find that it satisfies the equation for any λ,μR \lambda, \mu \in \mathbb{R} .

The final answer is p(x)=λx2+μx \boxed{ p(x) = \lambda x^2 + \mu x } , where λ,μR \lambda, \mu \in \mathbb{R} .

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.