Let $\lbrace a_n \rbrace$ be a real sequence. We say $\lim_{n\to\infty} a_n=\infty$ provided that:
$$\forall K>0, \exists N\in \mathbb{N} \forall n \ge N:a_n>K$$
Use this definition, as well as the Archimedean property, to prove that: $$\lim_{n\to\infty}n^3-4n^2-99n=\infty$$
In this context, the Archimedean property is defined as:
$$\forall c\in\mathbb{R} \exists n\in\mathbb{N}:n>c$$
I'm a little lost on how to use this particular definition of the limit. Perhaps if the roots were easier, it wouldn't be so difficult, but I'm not making progress even when I try simpler versions. So how could you prove this using that definition in a fairly simple way?
Write : $a_n = n^3 - 4n^2 - 99n = n(n^2 - 4n - 99)$.
Now, use a trivial bound : $n \geq 1$ for all $n \in \mathbb N$.
This gives $a_n \geq n^2 - 4n - 99 = (n-2)^2 - 103$.
Therefore, $a_n \geq (n-2)^2 - 103$ for all $n$. We will call this $(*)$
A small observation : if $a, b > 2$ are two numbers and $a > b$, then $a-2 >b-2$, so $(a-2)^2 > (b-2)^2$.
Now, we will start from the definition of the limit. So, let $K$ be any real number.
By the Archimedean property applied to $K$, we get there is some natural number $N_0$ such that $N_0 > \sqrt{K + 103} + 2$, since $\sqrt{K+103} + 2$ is also just a real number. Let $N = \max(N_0,2)$. Then $N \geq N_0$, so the same inequality also applies with left hand side as $N$.
Rearrange the above to get $(N-2)^2 - 103 > K$.
Now, take any $n > N$. We have the following inequalities: $$ a_n \geq (n - 2)^2 - 103 \geq (N-2)^2 - 103 > K $$ Where we used $(*)$ for the first inequality, and the small observation for the second inequality.
Since $K$ was any large enough real number, we have by the definition of limit that $\lim a_n = \infty$.
EDIT :