Fernando Barbero G., Juan Margalef-Bentabol, Eduardo J. S. Villaseñor
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in particular, a Faulhaber-like formula for sums of the form $1^m (n-1)^m + 2^m (n-2)^m + \cdots + (n-1)^m 1^m$ for positive integers $m$ and $n$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In a recent work, Zielinski used Faulhaber's formula to explain why the odd Bernoulli numbers are equal to zero. Here, we assume that the odd Bernoulli numbers are equal to zero to explain Faulhaber's formula.
This paper sets the groundwork for the consideration of families of recursively defined polynomials and rational functions capable of describing the Bernoulli numbers. These families of functions arise from various recursive definitions of the Bernoulli numbers. The derivation of these recursive definitions is shown here using the original application of the Bernoulli numbers: sums of powers of positive integers, i.e., Faulhaber's problem. Since two of the three recursive forms of the Bernoulli numbers shown here are readily available in literature and simple to derive, this paper focuses on t…
First, we present a new proof of Glaisher's formula dating from 1900 and concerning Wilson's theorem modulo p^2. Our proof uses p-adic numbers and Faulhaber's formula for the sums of powers (17th century), as well as more recent results on Faulhaber's coefficients obtained by Gessel and Viennot. Second, by using our method, we find a simpler proof than Sun's proof regarding a formula for (p-1)! modulo p^3, and one that can be generalized to higher powers of p. Third, we can derive from our method a way to compute the Stirling numbers modulo p^3, thus improving Glaisher and Sun's own results fr…
Faulhaber's formula, Bernoulli numbers, power sums of natural numbers and totatives and the functional equation $f(x)+x^k=f(x+1)$
本文研究了伯努利数与自然数幂和的关系，并通过函数方程 $f(x)+x^k=f(x+1)$ 探讨互质数幂和的表达式。
Faulhaber polynomials and reciprocal Bernoulli polynomials
本文综述Faulhaber多项式历史，并针对奇数n证明其递推性质，通过广义互反Bernoulli多项式的导数表达系数，简化表示并导出Bernoulli数的递推关系。
On (self-) reciprocal Appell polynomials: Symmetry and Faulhaber-type polynomials
本文研究广义（自）互反Appell多项式，证明满足反射关系的Appell序列的多项式可由二次变量替换得到的Faulhaber型多项式表示，系数由前者导数值给出，并给出在Bernoulli、Euler多项式及经典Faulhaber多项式中的应用。
We realize that geometric polynomials and p-Bernoulli polynomials and numbers are closely related with an integral representation. Therefore, using geometric polynomials, we extend some properties of Bernoulli polynomials and numbers such as recurrence relations, telescopic formula and Raabe's formula to p-Bernoulli polynomials and numbers. In particular cases of these results, we establish some new results for Bernoulli polynomials and numbers. Moreover, we evaluate a Faulhaber-type summation in terms of p-Bernoulli polynomials.
Generalization of Ramanujan's formula for sums of half-integer powers of consecutive integers via formal Bernoulli series
本文通过形式Bernoulli级数推广了Ramanujan关于连续整数半整数次幂求和的公式，扩展了原有结果到所有正半整数次幂。
For finite sums of non-negative powers of arithmetic progressions the generating functions (ordinary and exponential ones) for given powers are computed. This leads to a two parameter generalization of Stirling and Eulerian numbers. A direct generalization of Bernoulli numbers and their polynomials follows. On the way to find the Faulhaber formula for these sums of powers in terms of generalized Bernoulli polynomials one is led to a one parameter generalization of Bernoulli numbers and their polynomials. Generalized Lah numbers are also considered.
Denote by $Σn^m$ the sum of the $m$-th powers of the first $n$ positive integers $1^m+2^m+\ldots +n^m$. Similarly let $Σ^r n^m$ be the $r$-fold sum of the $m$-th powers of the first $n$ positive integers, defined such that $Σ^0 n^{m}=n^m$, and then recursively by $Σ^{r+1} n^{m}=Σ^{r} 1^{m}+Σ^{r} 2^{m}+\ldots + Σ^{r} n^{m}$. During the early 17th-century, polynomial expressions for the sums $Σ^r n^m$ and their factorisation and polynomial basis representation properties were examined by Johann Faulhaber, who published some remarkable theorems relating to these $r$-fold sums in his Academia Alge…
We consider the numbers $\mathcal{B}_{r,s} = (\mathbf{B}+1)^r \mathbf{B}^s$ (in umbral notation $\mathbf{B}^n = \mathbf{B}_n$ with the Bernoulli numbers) that have a well-known reciprocity relation, which is frequently found in the literature and goes back to the 19th century. In a recent paper, self-reciprocal Bernoulli polynomials, whose coefficients are related to these numbers, appeared in the context of power sums and the so-called Faulhaber polynomials. The numbers $\mathcal{B}_{r,s}$ can be recursively expressed by iterated sums and differences, so it is not obvious that these numbers d…
The power sum $1^n + 2^n + \cdots + x^n$ has been of interest to mathematicians since classical times. Johann Faulhaber, Jacob Bernoulli, and others who followed expressed power sums as polynomials in $x$ of degree $n+1$ with rational coefficients. Here we consider the denominators of these polynomials, and prove some of their properties. A remarkable one is that such a denominator equals $n+1$ times the squarefree product of certain primes $p$ obeying the condition that the sum of the base-$p$ digits of $n+1$ is at least $p$. As an application, we derive a squarefree product formula for the d…
On an exponential power sum
本文运用组合技术推导出一个递推恒等式，将负幂指数幂和用正幂指数幂和表示，并据此推导出前k个自然数的奇数幂和公式，结合Faulhaber公式可在某些情况下获取Bernoulli数。
We define a two-sided analog of Erdös measure on the space of two-sided expansions with respect to the powers of the golden ratio, or, equivalently, the Erdös measure on the 2-torus. We construct the transformation (goldenshift) preserving both Erdös and Lebesgue measures on $\Bbb T^2$ which is the induced automorphism with respect to the ordinary shift (or the corresponding Fibonacci toral automorphism) and proves to be Bernoulli with respect to both measures in question. This provides a direct way to obtain formulas for the entropy dimension of the Erdös measure on the interval, its entropy …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。