0
$\begingroup$

I'm reading Tom Apostol's calculus and I'm a bit stuck on proving an inequality which is part of the proof of theorem 1.15 (the integral of $x^p$).

$$ \sum_{k=1}^{n-1}k^p < \frac{n^{p+1}}{p+1} $$

Now the author says this can be proven by induction, but I have been trying for a few days without success! I'm sure it's pretty straightforward but for some reason I cannot get to it.

I would really be grateful if someone could help me finding the way out of this!

Thanks Fabrizio

  • 0
    It would be really great if you share your work and the manner you approached it! – 2017-01-16
  • 0
    $p$ is positive? – 2017-01-16
  • 0
    yes $p \geq 1$. – 2017-01-16

1 Answers 1

1

Hint. In the inductive step you have to show that $$\frac{n^{p+1}}{p+1}+n^p\leq \frac{(n+1)^{p+1}}{p+1}$$ that is $$(p+1)n^p\leq (n+1)^{p+1}-n^{p+1},$$ or $$\frac{p+1}{n}\leq \left(1+\frac{1}{n}\right)^{p+1}-1,$$ then use Bernoulli's inequality.

  • 0
    Isn't the mean value theorem a lot to assume for someone studying introductory calculus? – 2017-01-16
  • 0
    Hi Robert, I think shredalert is right. At this stage I'm not supposed to know what MVT is. I got exactly at the point you said above, but I'm not sure how to show the inductive step! Thanks – 2017-01-16
  • 0
    Fine. You can use also Bernoulli's inequality. See my edited answer.. – 2017-01-16
  • 0
    Excellent, thanks! – 2017-01-16