<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2d1 20170631//EN" "JATS-journalpublishing1.dtd">
<article xlink="http://www.w3.org/1999/xlink" dtd-version="1.0" article-type="general-sciences" lang="en"><front><journal-meta><journal-id journal-id-type="publisher">IJCRR</journal-id><journal-id journal-id-type="nlm-ta">I Journ Cur Res Re</journal-id><journal-title-group><journal-title>International Journal of Current Research and Review</journal-title><abbrev-journal-title abbrev-type="pubmed">I Journ Cur Res Re</abbrev-journal-title></journal-title-group><issn pub-type="ppub">2231-2196</issn><issn pub-type="opub">0975-5241</issn><publisher><publisher-name>Radiance Research Academy</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">1144</article-id><article-id pub-id-type="doi"/><article-id pub-id-type="doi-url"/><article-categories><subj-group subj-group-type="heading"><subject>General Sciences</subject></subj-group></article-categories><title-group><article-title>Power Sums Through Mathematical Induction&#13;
</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>Malathi</surname><given-names>R.</given-names></name></contrib><contrib contrib-type="author"><name><surname>Tamizharasi</surname><given-names>C.</given-names></name></contrib></contrib-group><pub-date pub-type="ppub"><day>6</day><month>06</month><year>2017</year></pub-date><volume>) </volume><issue> I</issue><fpage>68</fpage><lpage>70</lpage><permissions><copyright-statement>This article is copyright of Popeye Publishing, 2009</copyright-statement><copyright-year>2009</copyright-year><license license-type="open-access" href="http://creativecommons.org/licenses/by/4.0/"><license-p>This is an open-access article distributed under the terms of the Creative Commons Attribution (CC BY 4.0) Licence. You may share and adapt the material, but must give appropriate credit to the source, provide a link to the licence, and indicate if changes were made.</license-p></license></permissions><abstract><p>We observe that Faulhaber’s theorem on sums of odd powers holds an random arithmetic progression, the odd power sums of any arithmetic progression: a+b, a+2b,…, a+nb is a polynomial in n a + n(n+1)b/2. This assertion can be presumed from the original Faulhaber’s theorem. We use the Bernoulli polynomials for the alternative formula. By using the central factorial numbers as in the approach of knuth, we can derive the formulas for r – fold sums of powers without restoring the notion of r – reflective functions. We can also provide formulas for the r-fold alternating sums of powers in terms of Euler polynomials. In its simplest case, a power sum is a sum of the form Sn(l) = 1n + 2n + . . . . . +(l-1)n&#13;
Their sums have interesting combination of a number theoretical importance, and were already known by Bernoulli’s, but we shall see that even today there are many things about them to discover.&#13;
• Basics of power sums&#13;
• Generalizations of power sums&#13;
• Alternating power sums&#13;
In this paper, we are going to discuss about the negative power sum.&#13;
</p></abstract><kwd-group><kwd>Infinite sum</kwd><kwd> Partial sums</kwd><kwd> Euler polynomial</kwd></kwd-group></article-meta></front></article>
