It just so happens that when we wish to evaluate the integral [tex]\int^b_0 x^k dx[/tex], there are two main methods of doing it- Using the Fundamental theorem of Calculus, Or Integration by Riemann sums. The first method of course yields [tex]\frac{b^{k+1}}{k+1}[/tex].
Now when I proved this to myself the first time, I tried to use equal subdivisions of the integral, which previously had always worked for me. You'll see soon why I ran into a problem using that subdivision =] Instead I had to solve the more general integral, with lower bound a, with the subdivisions [itex]q= \left(\frac{b}{a} \right)^{1/n}[/itex].
Well anyway, the problem with equal subdivisions meant that when one approximated the integral with n upper Riemann sums, one ran into;
[tex]\frac{b}{n} \left( (\frac{b}{n})^k + ( \frac{2b}{n})^k + (\frac{3b}{n})^k ...(\frac{nb}{n})^k \right)[/tex]. Taking out the common factor;
[tex]\frac{b^{k+1}}{n^{k+1}} ( 1^k + 2^k + 3^k + 4^k...+ n^k)[/tex].
Now taking limits as n goes to infinity, since we know from the other method that this method should yield the b^(k+1)/(k+1), your limit is k+1. yay