中文
相关论文

相关论文: A remark on an explicit formula for the sums of po…

200 篇论文

In 2011, W. Lang derived a novel, explicit formula for the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$ involving simultaneously the Stirling numbers of the first and second kind. In this note, we first recall and then…

数论 · 数学 2023-05-09 José L. Cereceda

In this paper, we derive a formula for the sums of powers of the first $n$ positive integers, $S_k(n)$, that involves the hyperharmonic numbers and the Stirling numbers of the second kind. Then, using an explicit representation for the…

数论 · 数学 2021-06-15 José L. Cereceda

By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…

数论 · 数学 2022-12-06 José L. Cereceda

For integers $n,k \geq 1$, let $S_k(n)$ denote the power sum $1^k +2^k + \cdots + n^k$. In this note, we first recall the minimal recurrence relation connecting $S_k(n)$ and $S_{k-1}(n)$ established by Abramovich (1973). We then discuss an…

历史与综述 · 数学 2026-01-30 José L. Cereceda

In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.

数论 · 数学 2017-12-21 Fouad Bounebirat , Diffalah Laissaoui , Mourad Rahmani

For integer $k \geq 1$, let $S_k(n)$ denote the sum of the $k$th powers of the first $n$ positive integers. In this paper, we derive a new formula expressing $2^{2k}$ times $S_{2k}(n)$ as a sum of $k$ terms involving the numbers in the…

综合数学 · 数学 2025-01-27 José L. Cereceda

Recently, Kargin et al. (arXiv:2008.00284 [math.NT]) obtained (among many other things) the following formula for the hyper-sums of powers of integers $S_k^{(m)}(n)$ \begin{equation*} S_k^{(m)}(n) = \frac{1}{m!} \sum_{i=0}^{m} (-1)^i…

数论 · 数学 2022-01-07 José L. Cereceda

This paper gives new explicit formulas for sums of powers of integers and their reciprocals.

组合数学 · 数学 2020-06-03 Levent Kargın , Ayhan Dil , Mümün Can

For integer $k \geq 0$, let $S_k$ denote the sum of the $k$th powers of the first $n$ positive integers $1^k + 2^k + \cdots + n^k$. For any given $k$, the power sum $S_k$ can in principle be determined by differentiating $k$ times (with…

数论 · 数学 2023-03-24 José L. Cereceda

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

综合数学 · 数学 2024-11-20 Eteri Samsonadze

We study the divisibility of the sums of the odd power of consecutive integers, $S(m,k)=1^{mk}+2^{mk}+\cdots+k^{mk}$ and $1^k+2^k+\cdots+n^k$ for odd integers $m$ and $k$, by using the Girard-Waring identity. Faulhaber's approach for the…

组合数学 · 数学 2023-04-18 Tian-Xiao He , Peter J. -S. Shiue

The aim of this paper is to prove wordlessly the sum formula of $1^{k}+2^{k}+\ldots +n^{k}$, $k\in\{1,2,3\}$.

历史与综述 · 数学 2022-06-16 Bikash Chakraborty

For $k$ a positive integer let $S_k(n) = 1^k + 2^k + \cdots + n^k$, i.e., $S_k(n)$ is the sum of the first $k$-th powers. Faulhaber conjectured (later proved by Jacobi) that for $k$ odd, $S_k(n)$ could be written as a polynomial of…

数论 · 数学 2020-09-08 Steven J. Miller , Enrique Treviño

In this note we consider the theorem established in arXiv:1912.07171 concerning the sums of powers of the first $n$ positive integers, $S_k = 1^k + 2^k + \cdots + n^k$, and show that it can be used to demonstrate the classical theorem of…

数论 · 数学 2020-04-20 José L. Cereceda

In this paper we study the sum of powers in the Gaussian integers $\mathbf{G}_k(n):=\sum_{a,b \in [1,n]} (a+b i)^k$. We give an explicit formula for $\mathbf{G}_k(n) \pmod n $ in terms of the prime numbers $p \equiv 3 \pmod 4$ with $p \mid…

数论 · 数学 2014-02-05 Pedro Fortuny Ayuso , Jose Maria Grau , Antonio Oller-Marcen

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

数论 · 数学 2024-01-04 Cathal O'Sullivan , Jonathan P. Sorenson , Aryn Stahl

In this note, we derive an alternative recursive formula for the sums of powers of integers involving the Stirling numbers of the first kind. As a remarkable by-product, we provide a non-recursive definition of the Catalan numbers.

组合数学 · 数学 2021-03-09 José Luis Cereceda

We give a characterization of all pairs $(k,n)$ of positive integers for which the ratio $$ \frac{1^k-2^k+3^k-\dots+(-1)^{n+1} n^k}{1^k-2^k+3^k-\dots+(-1)^{n}(n-1)^k} $$ of two consecutive alternating power sums is an integer.

数论 · 数学 2019-07-16 Ioulia N. Baoulina

In this article we prove an algebraic identity which significantly generalizes the formula for sum of powers of consecutive integers involving Stirling numbers of the second kind. Also we have obtained a generalization of Newton-Girard…

组合数学 · 数学 2020-05-01 Sudip Bera , Sajal Kumar Mukherjee

We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.

经典分析与常微分方程 · 数学 2007-05-23 Peng Gao
‹ 上一页 1 2 3 10 下一页 ›