The hint is to use the highest index for which .

My idea, rather, is to break into k + 1 equal parts and to prove that each part is greater than for all 0 <= i < k (starting from some n). Then even if all non-leading coefficients are negative,

So it is sufficient to find N such that for all 0 <= i < k and all n > N we have .