Prove that there exists an integer greater than x such that any polynomial $f(x)$ will be strictly non-negative and get large? Hi I am taking a number theory class and so far I have been proving modular congruences, modular arithmetic, and prime properties. There is this theorem that came up in the textbook and apparently it does not involve any modular arithmetic. The theorem is as follows   

Suppose $f(x)=a_nx^n+a_{n-1}x^{n-1}+\dots+a_0$ is a polynomial of degree $n>0$. Then there exists an integer $k$ such that if $x>k$ then $f(x)>0$. 

I feel like this would come up in real analysis, but I have not come that far in my studies. I have an idea of applying induction and using the ceiling function somehow, but I have no idea how to start off this proof. Any help will do and thank you

I don't know what you're allowed to assume. Anyway here's one way to see why (as someone mentioned in the comments the leading coefficient should be positive for the theorem to hold; also the coefficients should be real):
It is obvious that the polynomial cannot be written as a product of more than $n$ linear polynomials, possibly with complex coefficients (for otherwise, it should have a degree greater than $n$). Thus, $f(x)$ does not vanish at more than $n$ points on the real line. Hence, there is some real $x'$ so that for all $x>x',$ we must have $f(x)\ne 0.$ By continuity (and the fact that $f(x)\to+\infty$ as $x\to+\infty$ -- factor out $x^n$ to see this, recalling that $a_n>0$), it follows that $f(x)<0$ just before the last zero, so that just after this $f(x)>0.$ Taking $x'$ to be sufficiently close to, but after, this last zero, and recalling after $x'$ the polynomial retains constant sign, it follows that it must be positive for all $x>x'.$ Finally, by the principle of Archimedes you can find some positive integer greater than this $x'.$
