Xenaro García Suárez
This paper deals with an approach to sums of k-th powers, different from the well-known Pascal recursion formula (1654). Our approach, while being also recursive, does not involve a greater difficulty in its application that Pascal’s formula and it is also very easy to memorize.
© 2008-2025 Fundación Dialnet · Todos los derechos reservados