Let ξ be the positive root of the equation x2+x−4=0. The polynomial P(x)=anxn+an−1xn−1+⋯+a1x+a0, where n is a positive integer, has nonnegative integer coefficients and P(ξ)=2017. (i) Prove that: a0+a1+⋯+an≡1(mod2) (ii) Find the least possible value of the sum: a0+a1+⋯+an.
Solution
(i) Since ξ=2−1+17 is irrational and the polynomial Fx=Px−2017 has rational coefficients and ξ as a root, then it will have also the conjugate 2−1−17 as a root, and therefore it is divided by the polynomial φx=x2+x−4. It comes easily from the identity Fx=Px−2017=x2+x−4Qx+κx+λ, by putting x=ξ. Then κξ+λ=0 which gives κ=λ=0, taking in mind that ξ is irrational. Therefore there exists a polynomial Qx such that: Fx=Px−2017⇔anxn+an−1xn−1+⋯+a1x+a0−2017=x2+x−4Qx=x2+x−4Qx(1) From (1) for x=1 we get: ⇒a0+a1+⋯+an=2017−2Q1≡1mod 2a0+a1+⋯+an−2017=−2Q1
(ii) We consider the set a0,a1,...,an with elements nonnegative integers satisfying the following: (α) anξn+an−1ξn−1+...+a1ξ+a0=2017 and (β) the sum a0+a1+...+an is minimal. First we observe that: 0≤ai≤3, for all i=1,2,...,n−2. In fact, if it was not true for someone i=1,2,...,n−2, then the elements of the set a0,...,ai−1,ai−4,ai−1+1,ai+1+1,ai+2+1,ai+3,...,an would be nonnegative integers, it would satisfy relation (α), while the sum of its elements would be less than of a1+a2+...+an, which is absurd. Let now Qx=bn−2xn−2+bn−1xn−1+...+b1x+b0. Then from the identity anxn+an−1xn−1+...+a1x+a0−2017=x2+x−4bn−2xn−2+bn−3xn−3+...+b1x+b0 we get the equations: a 0 - 2017 = -4b 0 a 1 = -4b 1 + b 0 a 2 = -4b 2 + b 1 + b 0 a 3 = -4b 3 + b 2 + b 1 ........................................ a n-2 = -4b n-2 + b n-3 + b n-4 a n-1 = b n-2 + b n-3 a n = b n-2 a 0 - 2017 = -4b 0 a 1 - b 0 = -4b 1 a 2 - b 1 - b 0 = -4b 2 a 3 - b 2 - b 1 = -4b 3 ........................................ a n-2 - b n-3 - b n-4 = -4b n-2 a n-1 - b n-2 = b n-3 a n = b n-2 In general we have: ai+2−bi+1−bi=−4bi+2, for all i=0,1,...,n−4 Since 0≤ai≤3, for all i=1,2,...,n−2, from the first equation we have a0=1 and b0=504. From the second equation we get a1=0 and b1=126. From the third equation we get a2=2 and b2=157. Continuing in the same way we find the sets b0,b1,b2,...b14=504,126,157,70,56,31,21,13,8,5,3,2,1,0,0 a0,a1,a2,...a14=1,0,2,3,3,2,3,0,2,1,1,0,1,3,1 Therefore the least possible value of the sum a0+a1+...+an is 23.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.