{"id":{"repo_id":"csusb","oai_identifier":"oai:scholarworks.lib.csusb.edu:etd-2256"},"canonical_url":"https://search.ndltd.org/etd/csusb/oai:scholarworks.lib.csusb.edu:etd-2256","repository":{"repo_id":"csusb","name":"CSUniversity San Bernardino","base_url":"https://scholarworks.lib.csusb.edu/do/oai/"},"display":{"title":"Sum of Cubes of the First n Integers","abstract":"In Calculus we learned that 􏰅Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{􏰅n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. At the very least, we needed to know that the sum of the first n integers is a polynomial, 1/2 n^2 + · · · of degree 2, the sum of the squares of the first n integers is a polynomial, 1/3 n^3 + · · · of degree 3; lastly, the sum of the cubes of the first n integers is a polynomial, 1/4 n^4 + · · · of degree 4. This resulted in the recognition of a pattern; hence, the generalization; the sum of the r-th powers of the first n integers is a polynomial, 1/(r+1)n^(r+1) + · · · of degree r + 1. Thus, we arrive at the theorem Theorem 0.0.1. Let r ≥ 0 be an integer. Then there is a unique polynomial, p_r(x) of degree r + 1 with the leading coefficient 1/(r+1) such that for every integer n, Sum^{n}_{k=1}􏰇k^r =p_r(n). To some math scholars, these polynomials are called Faulhaber polynomials, named after Faulhaber, a German mathematician, who was one of the first mathematicians to recognize that the sum of r-th powers is indeed a polynomial. His discoveries resulted in “simple” forms of formulating these polynomials when r is odd. I will prove Theorem 0.0.1, and many other properties of Faulhaber polynomials. For example, I will prove that for all r the coefficient of x^r is 1/2. Thus p_r(x)= 1/(r+1)x^(r+1)+1/2x^r+···. The remaining coefficients of this polynomial, do not have a simple form. This is especially the case for the coefficient of x. It turns out that the coefficients of x in p_r(x), are the so-called Bernoulli numbers. I will establish this as well as many related properties about Bernoulli numbers. I will end my thesis with an interesting observation discussed in [8]. The formula for the sum of cubes is especially interesting giving us the identity 1^{3}+2^{3}+3^{3}+...+(n-2)^{3}+(n-1)^{3}+n^{3} = (1+2+3+...+(n-2)+(n-1)+n)^{2}. If in both left hand and right-hand sides of this identity we replace the term (n-1) by 2 one would think that the resulting equality 1^{3}+2^{3}+3^{3}+...+(n-2)^{3}+(2)^{3}+n^{3} = (1+2+3+...+(n-2)+(2)+n)^{2} is false. What was shown in [8] is actually true. Moreover, the pair ((n-2),2) is the only such switch that works for all n.","abstract_html":"In Calculus we learned that 􏰅Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{􏰅n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. At the very least, we needed to know that the sum of the first n integers is a polynomial, 1/2 n^2 + · · · of degree 2, the sum of the squares of the first n integers is a polynomial, 1/3 n^3 + · · · of degree 3; lastly, the sum of the cubes of the first n integers is a polynomial, 1/4 n^4 + · · · of degree 4. This resulted in the recognition of a pattern; hence, the generalization; the sum of the r-th powers of the first n integers is a polynomial, 1/(r+1)n^(r+1) + · · · of degree r + 1. Thus, we arrive at the theorem Theorem 0.0.1. Let r ≥ 0 be an integer. Then there is a unique polynomial, p_r(x) of degree r + 1 with the leading coefficient 1/(r+1) such that for every integer n, Sum^{n}_{k=1}􏰇k^r =p_r(n). To some math scholars, these polynomials are called Faulhaber polynomials, named after Faulhaber, a German mathematician, who was one of the first mathematicians to recognize that the sum of r-th powers is indeed a polynomial. His discoveries resulted in “simple” forms of formulating these polynomials when r is odd. I will prove Theorem 0.0.1, and many other properties of Faulhaber polynomials. For example, I will prove that for all r the coefficient of x^r is 1/2. Thus p_r(x)= 1/(r+1)x^(r+1)+1/2x^r+···. The remaining coefficients of this polynomial, do not have a simple form. This is especially the case for the coefficient of x. It turns out that the coefficients of x in p_r(x), are the so-called Bernoulli numbers. I will establish this as well as many related properties about Bernoulli numbers. I will end my thesis with an interesting observation discussed in [8]. The formula for the sum of cubes is especially interesting giving us the identity 1^{3}+2^{3}+3^{3}+...+(n-2)^{3}+(n-1)^{3}+n^{3} = (1+2+3+...+(n-2)+(n-1)+n)^{2}. If in both left hand and right-hand sides of this identity we replace the term (n-1) by 2 one would think that the resulting equality 1^{3}+2^{3}+3^{3}+...+(n-2)^{3}+(2)^{3}+n^{3} = (1+2+3+...+(n-2)+(2)+n)^{2} is false. What was shown in [8] is actually true. Moreover, the pair ((n-2),2) is the only such switch that works for all n.","abstract_has_math":false,"creators":["Agu, Obiamaka L"],"institution":null,"degree_name":"Master of Arts in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Fejzic, Hajrudin"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:07:40Z","subjects":["Mathematics","Faulhaber","Bernoulli","Sums","Integers","Analysis","Algebra","Algebraic Geometry","Applied Mathematics","Dynamic Systems","Number Theory","Numerical Analysis and Computation","Ordinary Differential Equations and Applied Dynamics","Other Applied Mathematics","Other Mathematics","Physical Sciences and Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd/1132","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://scholarworks.lib.csusb.edu/etd/1132","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://scholarworks.lib.csusb.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Ascholarworks.lib.csusb.edu%3Aetd-2256","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Fejzic, Hajrudin"]},{"key":"dc:creator","label":"Author","values":["Agu, Obiamaka L"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2020-08-24T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2020-12-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics","Faulhaber","Bernoulli","Sums","Integers","Analysis","Algebra","Algebraic Geometry","Applied Mathematics","Dynamic Systems","Number Theory","Numerical Analysis and Computation","Ordinary Differential Equations and Applied Dynamics","Other Applied Mathematics","Other Mathematics","Physical Sciences and Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd/1132"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In Calculus we learned that 􏰅Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{􏰅n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. At the very least, we needed to know that the sum of the first n integers is a polynomial, 1/2 n^2 + · · · of degree 2, the sum of the squares of the first n integers is a polynomial, 1/3 n^3 + · · · of degree 3; lastly, the sum of the cubes of the first n integers is a polynomial, 1/4 n^4 + · · · of degree 4. This resulted in the recognition of a pattern; hence, the generalization; the sum of the r-th powers of the first n integers is a polynomial, 1/(r+1)n^(r+1) + · · · of degree r + 1. Thus, we arrive at the theorem Theorem 0.0.1. Let r ≥ 0 be an integer. Then there is a unique polynomial, p_r(x) of degree r + 1 with the leading coefficient 1/(r+1) such that for every integer n, Sum^{n}_{k=1}􏰇k^r =p_r(n). To some math scholars, these polynomials are called Faulhaber polynomials, named after Faulhaber, a German mathematician, who was one of the first mathematicians to recognize that the sum of r-th powers is indeed a polynomial. His discoveries resulted in “simple” forms of formulating these polynomials when r is odd. I will prove Theorem 0.0.1, and many other properties of Faulhaber polynomials. For example, I will prove that for all r the coefficient of x^r is 1/2. Thus p_r(x)= 1/(r+1)x^(r+1)+1/2x^r+···. The remaining coefficients of this polynomial, do not have a simple form. This is especially the case for the coefficient of x. It turns out that the coefficients of x in p_r(x), are the so-called Bernoulli numbers. I will establish this as well as many related properties about Bernoulli numbers. I will end my thesis with an interesting observation discussed in [8]. The formula for the sum of cubes is especially interesting giving us the identity 1^{3}+2^{3}+3^{3}+...+(n-2)^{3}+(n-1)^{3}+n^{3} = (1+2+3+...+(n-2)+(n-1)+n)^{2}. If in both left hand and right-hand sides of this identity we replace the term (n-1) by 2 one would think that the resulting equality 1^{3}+2^{3}+3^{3}+...+(n-2)^{3}+(2)^{3}+n^{3} = (1+2+3+...+(n-2)+(2)+n)^{2} is false. What was shown in [8] is actually true. Moreover, the pair ((n-2),2) is the only such switch that works for all n."]},{"key":"dc:title","label":"Title","values":["Sum of Cubes of the First n Integers"]}]}],"canonical_facts":{"dc:contributor":["Fejzic, Hajrudin"],"dc:creator":["Agu, Obiamaka L"],"dc:date.available":["2020-08-24T07:00:00Z"],"dc:date.created":["2020-12-01T08:00:00Z"],"dc:description.abstract":["In Calculus we learned that 􏰅Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{􏰅n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. At the very least, we needed to know that the sum of the first n integers is a polynomial, 1/2 n^2 + · · · of degree 2, the sum of the squares of the first n integers is a polynomial, 1/3 n^3 + · · · of degree 3; lastly, the sum of the cubes of the first n integers is a polynomial, 1/4 n^4 + · · · of degree 4. This resulted in the recognition of a pattern; hence, the generalization; the sum of the r-th powers of the first n integers is a polynomial, 1/(r+1)n^(r+1) + · · · of degree r + 1. Thus, we arrive at the theorem Theorem 0.0.1. Let r ≥ 0 be an integer. Then there is a unique polynomial, p_r(x) of degree r + 1 with the leading coefficient 1/(r+1) such that for every integer n, Sum^{n}_{k=1}􏰇k^r =p_r(n). To some math scholars, these polynomials are called Faulhaber polynomials, named after Faulhaber, a German mathematician, who was one of the first mathematicians to recognize that the sum of r-th powers is indeed a polynomial. His discoveries resulted in “simple” forms of formulating these polynomials when r is odd. I will prove Theorem 0.0.1, and many other properties of Faulhaber polynomials. For example, I will prove that for all r the coefficient of x^r is 1/2. Thus p_r(x)= 1/(r+1)x^(r+1)+1/2x^r+···. The remaining coefficients of this polynomial, do not have a simple form. This is especially the case for the coefficient of x. It turns out that the coefficients of x in p_r(x), are the so-called Bernoulli numbers. I will establish this as well as many related properties about Bernoulli numbers. I will end my thesis with an interesting observation discussed in [8]. The formula for the sum of cubes is especially interesting giving us the identity 1^{3}+2^{3}+3^{3}+...+(n-2)^{3}+(n-1)^{3}+n^{3} = (1+2+3+...+(n-2)+(n-1)+n)^{2}. If in both left hand and right-hand sides of this identity we replace the term (n-1) by 2 one would think that the resulting equality 1^{3}+2^{3}+3^{3}+...+(n-2)^{3}+(2)^{3}+n^{3} = (1+2+3+...+(n-2)+(2)+n)^{2} is false. What was shown in [8] is actually true. Moreover, the pair ((n-2),2) is the only such switch that works for all n."],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd/1132"],"dc:subject":["Mathematics","Faulhaber","Bernoulli","Sums","Integers","Analysis","Algebra","Algebraic Geometry","Applied Mathematics","Dynamic Systems","Number Theory","Numerical Analysis and Computation","Ordinary Differential Equations and Applied Dynamics","Other Applied Mathematics","Other Mathematics","Physical Sciences and Mathematics"],"dc:title":["Sum of Cubes of the First n Integers"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Arts in Mathematics"]},"updated_at":"2026-11-19T08:07:40Z"}