I have the following problem and I am stuck on it. Any ideas on how to work it?

Let k be a positive integer. Show that 1^k + 2^k + ... + n^k is O( n^(k+1) )

Printable View

- Mar 19th 2009, 11:08 AMothninBig O puzzler
I have the following problem and I am stuck on it. Any ideas on how to work it?

Let k be a positive integer. Show that 1^k + 2^k + ... + n^k is O( n^(k+1) ) - Mar 20th 2009, 07:36 AMOpalg
- Mar 20th 2009, 01:33 PMothnin
Interesting,

I was trying to do a proof by Induction. Do you know if it's possible to it that way?

Thanks for heads up! - Mar 21st 2009, 04:52 AMLaurent
- Mar 21st 2009, 03:22 PMothnin
Thanks guys. I think I can get a proof out of it now.