Published 08/07/2023
Keywords
- sumas de potencias,
- sumas telescópicas,
- recurrente,
- progresión aritmética,
- método recursivo
How to Cite
Copyright (c) 2023 Víctor Biot Domingo
This work is licensed under a Creative Commons Attribution 4.0 International License.
Abstract
Many mathematicians have always found sums of powers of positive integers appealing. From ancient times, humans needed to count, order and have a full understanding of nature's phenomena. Through the current paper we shall discuss the same mathematical curiosity connected to finite series, trying to obtain closed formulas which can automatically work out the solution for every single sum given a positive integer series elevated to a positive integer exponent. This article is based upon the method known as telescoping sum. We shall prove a general formula in which the sum to be obtained will be recursively found and eventually implemented with some lines of code in a computer algebra system.