Difference between revisions of "1975 IMO Problems/Problem 6"
Line 1: | Line 1: | ||
+ | ==Problem== | ||
Find all polynomials <math>P</math>, in two variables, with the following properties: | Find all polynomials <math>P</math>, in two variables, with the following properties: | ||
Line 6: | Line 7: | ||
(iii) <cmath>P(1, 0) = 1.</cmath> | (iii) <cmath>P(1, 0) = 1.</cmath> | ||
+ | |||
+ | ==Solution 1== | ||
+ | (i) If <math>n = 0</math> : Clearly no solution | ||
+ | (ii) If <math>n = 1</math> : <math>P(x, y) = ax+by \implies</math> the identification yields directly <math>P(x,y) = x-2y</math> | ||
+ | (iii) If <math>n > 1</math>, <math>a = 1, \ b = 1, \ c =-2 \implies P(2,-2)+P(-1, 1)+P(-1, 1) = 0</math> <math>\implies ((-2)^{n}+2) P(-1, 1) = 0 \implies P(-1, 1) = 0 \implies P(-y, y) = 0 \implies</math> <math>P(x,y)</math> is divisible by <math>(x+y)</math> | ||
+ | It is then easy to see that <math>\frac{P(x, y)}{(x+y)}</math>, of degree <math>n-1</math> verifies all the equations. | ||
+ | |||
+ | The only solutions are thus <math>P(x, y) = (x-2y)(x+y)^{n-1}</math> | ||
+ | |||
+ | The above solution was posted and copyrighted by mathmanman. The original thread for this problem can be found here: [https://aops.com/community/p587109] | ||
+ | |||
+ | ==Solution 2== | ||
+ | <math>F(a,a,a) \implies P(2a,a)=0 \implies (x-2y)</math> is a factor of <math>P(x,y)</math>. | ||
+ | |||
+ | We may write <math>P(x,y)=(x-2y)Q(x,y)</math> | ||
+ | |||
+ | <math>F(a,b,b) \implies 2P(a+b,b)+P(2b,a)=0 \implies 2(a+b-2b)Q(a+b,b)+2(b-a)Q(2b,a) \implies (a-b)(Q(a+b,b)-Q(2b,a))=0</math> | ||
+ | Thus <math>Q(a+b,b)=Q(2b,a) \forall a \neq b</math> | ||
+ | |||
+ | We may rewrite it as <math>Q(x,y)=Q(2y,x-y)=Q(2x-2y,3y-x=\cdots</math> | ||
+ | <math>Q(x+d,y-d)-Q(x,y)</math> is a polynomial in <math>d</math> of degree <math>n-1</math> for any two fixed <math>x,y</math>,which has infinitely many zeroes,i.e,<math>0,2y-x,x-2y,6y-3x,\cdots</math>.Thus <math>Q(x+d,y-d)=Q(x,y)</math> holds for all <math>d</math>.In particular it holds for <math>d=y</math>,i.e, <math>Q(x+y,0)=Q(x,y)</math>.Now consider the polynomial <math>R(x,y)=Q(x+y,0)-Q(x,y)</math>.Suppose that its not the zero polynomial.Then its degree <math>d</math> is defined.With <math>t=\frac{x}{y}</math> it can be wriiten as <math>y^dS(t)=y^d(A(t)-B(t))</math>.But <math>S(t)</math> has infinitely many zeroes and this forces <math>A(t)=B(t)</math>,forcing <math>R(x,y)</math> to be a zero polynomial.Contradiction!.Thus <math>Q(x+y,0)</math> and <math>Q(x,y)</math> are identical polynomials.This forces <math>Q(x,y)=c(x+y)^{n-1}</math>.With <math>Q(1,0)=1</math> we get <math>c=1</math>.Thus | ||
+ | <cmath>P(x,y)=(x-2y)(x+y)^{n-1}</cmath> | ||
+ | |||
+ | The above solution was posted and copyrighted by JackXD. The original thread for this problem can be found here: [https://aops.com/community/p5745013] | ||
+ | |||
+ | == See Also == {{IMO box|year=1974|num-b=5|after=Last Problem}} |
Latest revision as of 15:21, 29 January 2021
Contents
Problem
Find all polynomials , in two variables, with the following properties:
(i) for a positive integer and all real (that is, is homogeneous of degree ),
(ii) for all real ,
(iii)
Solution 1
(i) If : Clearly no solution (ii) If : the identification yields directly (iii) If , is divisible by It is then easy to see that , of degree verifies all the equations.
The only solutions are thus
The above solution was posted and copyrighted by mathmanman. The original thread for this problem can be found here: [1]
Solution 2
is a factor of .
We may write
Thus
We may rewrite it as is a polynomial in of degree for any two fixed ,which has infinitely many zeroes,i.e,.Thus holds for all .In particular it holds for ,i.e, .Now consider the polynomial .Suppose that its not the zero polynomial.Then its degree is defined.With it can be wriiten as .But has infinitely many zeroes and this forces ,forcing to be a zero polynomial.Contradiction!.Thus and are identical polynomials.This forces .With we get .Thus
The above solution was posted and copyrighted by JackXD. The original thread for this problem can be found here: [2]
See Also
1974 IMO (Problems) • Resources | ||
Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Problem |
All IMO Problems and Solutions |