Let k be a positive integer. Show that 1^k+2^k+...+n^k is O(n^(k+1)).
Favorites|Homepage
Subscriptions | sitemap
HOME > Mathematics > Let k be a positive integer. Show that 1^k+2^k+...+n^k is O(n^(k+1)).

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

[From: ] [author: ] [Date: 11-10-14] [Hit: ]
.≤ n^k + n^k + ...= n^(k+1) for all n ≥ 1.Hence 1^k + 2^k + .......
I am stuck on this problem for my discrete math class. Any help would be greatly appreciated.

-
Note that
1^k + 2^k + ... + n^k
≤ n^k + n^k + ... + n^k
= n * n^k
= n^(k+1) for all n ≥ 1.

Hence 1^k + 2^k + ... + n^k is O(n^(k+1)).

I hope this helps!
1
keywords: positive,that,be,Show,integer,is,Let,Let k be a positive integer. Show that 1^k+2^k+...+n^k is O(n^(k+1)).
New
Hot
© 2008-2010 http://www.science-mathematics.com . Program by zplan cms. Theme by wukong .