For some fixed natural $k$, we need to find the limit. I have been trying to solve this question in so many different ways now.. I will just outline one here. This should be solvable with the Stolz theorem.
My most recent idea was to treat the two terms separately, and first find the limit of the leftmost term. Then hopefully our limit is something that will take out the $n$ in the second term from the numerator. That is not the case...
Let's define $\tilde{x}_n = \sum_{i=1}^n i^k$, our numerator. Then $\tilde{y}_n = n^k$ will be our defnominator. We have that $\frac{x_n - x_{n-1}}{y_n - y_{n-1}} = \frac{n^k}{n^k - (n-1)^{k-1}}$, using binomial expansion or simply taking out the $n^k$, we see that this thing goes to plus infinity...
If I incorporate the second term in the original equation in my computations. Then I get that this difference ($\frac{x_n - x_{n-1}}{y_n - y_{n-1}}$) is also infinite: $$\frac{(1-n)(1-(1-1/n)^k)+k}{(k+1)(1-(1-1/n)^k}$$
So I am lost as to how to approach this problem now.
$$ \lim\limits_{n \to +\infty} \frac{(k+1)\cdot(1+\ldots+n^k)-n^{k+1}}{(k+1)\cdot n^k} = \lim\limits_{n\to +\infty} \frac{(k+1)\cdot (n+1)^{k}+n^{k+1} - (n+1)^{k+1}}{(k+1)\cdot((n+1)^k - n^k)} = \lim\limits_{n \to +\infty} \frac{n^{k-1} \cdot (k(k+1))/2}{n^{k-1} \cdot k(k+1)} = \frac{1}{2}$$
The first equality is due to Stoltz Cesaro's Theorem, while in the second one I am just considering the highest power in $n$ since they are polynomials.
I hope now it is correct!