Let be a degree polynomial whose coefficients are all even integers. Suppose can be written as where and again are non-constant polynomials with integer coefficients, both having degree . Let denote the number of even coefficients of and let denote the number of even coefficients of As ranges over all such irreducible degree polynomials in find the minimum possible value of
Details and assumptions
As an explicit example, the polynomial has even coefficient (coefficient of ).
Note that in a polynomial with degree the coefficients of for all are zero. These coefficients aren't counted in the count of even coefficients.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let g ( x ) = i = 0 ∑ 2 0 1 4 / 2 a i x i and h ( x ) = i = 0 ∑ 2 0 1 4 / 2 b i x i . We claim that in order for f ( x ) to have all its coefficients even, either all coefficients of g ( x ) must be even or all coefficients of h ( x ) must be even. Assume the contrary. Let p be the smallest index for which a p is odd, and let q be the smallest index for which b q is odd. Note that the coefficient of x p + q in f ( x ) is i = 0 ∑ p + q a i b p + q − i . The only odd term in this summation is a p b q , since a i is even for all i < p and b i is even for all i < q . Thus, the coefficient of x p + q in f ( x ) is odd, contradiction.
It follows that atleast one of N g or N h must be 2 2 0 1 4 + 1 , so N g + N h ≥ 1 0 0 8 . We can set all coefficients of g ( x ) even and all coefficients of h ( x ) odd. Note that this satisfies the problem condition, since if a i = 2 c i for all i for some c i ∈ N , f ( x ) = g ( x ) h ( x ) = 2 ⎝ ⎛ i = 0 ∑ 2 0 1 4 / 2 c i x i ⎠ ⎞ ⎝ ⎛ i = 0 ∑ 2 0 1 4 / 2 b i x i ⎠ ⎞ , whose coefficients are clearly even. Thus, N g + N h = 1 0 0 8 is attainable, and our answer is 1 0 0 8 − 1 = 1 0 0 7 .