Show that for all n sufficiently large the denominator grows faster than the numerator
I'm trying to determine whether the below sequence converges.
I see the dominant term is n^5, so then I divide numerator and denominator by this.
So the next stage is to apply the combination rules (in my text book).
I seem to be stuck at the first one which is . I am not sure what to do with this one so help on this would be great.