José L. Cereceda
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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…
Faulhaber polynomials and reciprocal Bernoulli polynomials
本文综述Faulhaber多项式历史，并针对奇数n证明其递推性质，通过广义互反Bernoulli多项式的导数表达系数，简化表示并导出Bernoulli数的递推关系。
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$.
Let $S_p(n)$ denote the sum of $p$th powers of the first $n$ positive integers $1^p + 2^p + \cdots + n^p$. In this paper, first we express $S_p(n)$ in the so-called Faulhaber form, namely, as an even or odd polynomial in $(n + 1/2)$, according as $p$ is odd or even. Then, using the relation $S_p(n) - S_p(n-1) = n^p$, we derive a recursive formula for the associated Faulhaber coefficients. Applying Cramer's rule to the corresponding system of equations, we obtain an explicit determinant formula for the said coefficients. Furthermore, we show how to convert the (even or odd) Faulhaber polynomial…
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)$ 探讨互质数幂和的表达式。
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.
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…
On an exponential power sum
本文运用组合技术推导出一个递推恒等式，将负幂指数幂和用正幂指数幂和表示，并据此推导出前k个自然数的奇数幂和公式，结合Faulhaber公式可在某些情况下获取Bernoulli数。
In the paper, I consider appearance of unit's digits in minor totals of a few integer sequences. The sequences include the sequence of even integers, sequence of odd integers and Faulhaber polynomial at $p = 2$. Application of difference tables allows predicting of which digits can appear as unit's digits in minor totals of the sequences. Absence of some digits ("gaps" in frequency distributions) depends often on numbering system applied. However, in case of odd numbers' integers the gaps are found under all numbering systems with bases from 3 to 10.
Generalization of Ramanujan's formula for sums of half-integer powers of consecutive integers via formal Bernoulli series
本文通过形式Bernoulli级数推广了Ramanujan关于连续整数半整数次幂求和的公式，扩展了原有结果到所有正半整数次幂。
The generalized Bernoulli numbers and its relation with the Riemann zeta function at odd-integer arguments
本研究借助广义伯努利数推导正奇数自变量处黎曼ζ函数的新积分表示，进而得到相关有理数域上向量空间维数的判定准则。
Inspired by a famous identity of Ramanujan, we propose a general formula linearizing the convolution of Dirichlet series as the sum of Dirichlet series with modified weights; its specialization produces new identities and recovers several identities derived earlier in the literature, such as the convolution of squares of Bernoulli numbers by A. Dixit and collaborators, or the convolution of Bernoulli numbers by Y. Komori and collaborators.
On a certain arithmetic function defined via Bernoulli numbers
研究定义在奇数\(n\geq3\)上、通过伯努利数构造的算术函数，该函数将素数、卡迈克尔数和久加数统一到一个整除性准则中，为相关研究提供新视角。
In 2003, Zhao discovered a curious congruence involving harmonic series and Bernoulli numbers: for any odd prime $p$, $$\sum_{\substack{i,j,k\ge 1\\\gcd(ijk,p)=1\ı+j+k=p}}\frac{1}{ijk}\equiv -2B_{p-3} \pmod{p},$$ where $B_n$ is the $n$-th Bernoulli number. This congruence was generalized by Wang and Cai in 2014, and Cai, Shen and Jia in 2017 by replacing the odd prime $p$ in the summation and modulus with an odd prime power, and a product of two odd prime powers, respectively. In particular, Cai, Shen and Jia proposed a conjectural congruence: for any positive integer $n$ with an odd prime fac…
Consider the average of the first n k-th powers. We pose and answer the following natural question: For which values of n and k is this average an integer? If k is odd the answer is easy; it is an integer as long as n is incongruent to 2 modulo 4. If k is even then the criterion involves the denominator of the k-th Bernoulli number. The average is an integer iff $n$ is not divisible by any prime which divides the denominator of the k-th Bernoulli number.
We study matrices which transform the sequence of Fibonacci or Lucas polynomials with even index to those with odd index and vice versa. They turn out to be intimately related to generalized Stirling numbers and to Bernoulli, Genocchi and tangent numbers and give rise to various identities between these numbers. There is also a close connection with the Akiyama-Tanigawa algorithm.
Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every sufficiently large prime $p$ $$ \sum_{\substack{l_1+l_2+\cdots+l_n=mp^r p\nmid l_1 l_2 \cdots l_n }} \frac1{l_1l_2\cdots l_n} \equiv p^{r-1} \sum_{{\bf k}\vdash n} C_{m,{\bf k}} B_{p-{\bf k}} \pmod{p^r} $$ where $B_{p-{\bf k}}=B_{p-k_1}B_{p-k_2}\cdots B_{p-k_t}$ are products of Bernoulli numbers and the coefficients $C_{m,{\bf k}}$ are polynomials of $m$ independent of…
Given an odd prime p, we present three independent ways of relating modulo p certain truncated convolutions of divided Bernoulli numbers to certain full convolutions of divided Bernoulli numbers.
With this paper we introduce a new series representation of $ζ(3)$, which is based on the Clausen representation of odd integer zeta values. Although, relatively fast converging series based on the Clausen representation exist for $ζ(3)$, their convergence behavior is very slow compared to BBP-type formulas, and as a consequence they are not used for explicit numerical computations. The reason is found in the fact that the corresponding Clausen function can be calculated analytically for a few rational arguments only, where $x=\frac{1}{6}$ is the smallest one. Using polylogarithmic identities …
We show that, modulo some odd prime p, the powers of two weighted sum of the first p-2 divided Bernoulli numbers equals the Agoh-Giuga quotient plus twice the number of permutations on p-2 letters with an even number of ascents and distinct from the identity. We provide a combinatorial characterization of Wieferich primes, as well as of primes p for which p^2 divides the Fermat quotient q_p(2).
Twisted Bernoulli Zeros in Quasi-Linear Time: Distribution, Depth, and Explicit Hilbert Class Components
本文研究准线性时间下的扭曲伯努利零点分布与深度，将零点转换为显式希尔伯特类分量生成元，扩展了相关目录范围，验证了零点性质并记录了非简单零点线。
We observe that five polynomial families have all of their zeros on the unit circle. We prove the statements explicitly for four of the polynomial families. The polynomials have coefficients which involve Bernoulli numbers, Euler numbers, and the odd values of the Riemann zeta function. These polynomials are closely related to the Ramanujan polynomials, which were recently introduced by Murty, Smyth and Wang. Our proofs rely upon theorems of Schinzel, and Lakatos and Losonczi and some generalizations.
For non-negative integers $r$ and $m$, let $S_m^{(r)}(n)$ denote the $r$-fold summation (or hyper-sum) over the first $n$ positive integers to the $m$th powers, with the initial condition $S_m^{(0)}(n) =n^m$. In this paper, we derive a new determinantal formula for $S_m^{(r)}(n)$. Specifically, we show that, for all integers $r\geq 0$ and $m \geq 1$, $S_m^{(r)}(n)$ is proportional to $S_1^{(r)}(n)$ times the determinant of a lower Hessenberg matrix of order $m-1$ involving the Bernoulli numbers and the variable $N_r = n + \frac{r}{2}$. Furthermore, whenever $r\geq 1$, evaluating this determina…
Two Legendre-symbol determinants of Sun and Bernoulli numbers
本文给出Sun定义的两个Legendre符号行列式模p的显式公式（用Bernoulli数表示），并利用Reinhart的反例找到使行列式模p为零的素数，否定回答了Sun的一个问题。
Normal numbers in sparse Cantor sets
研究豪斯多夫维数为零的康托型集合中正规数，通过扩展施密特方法，证明独立非均匀分布伯努利数字诱导测度赋予奇基数下正规数全质量，并给出显式算法构造，支持相关猜想。
Let $\ell$ be any fixed prime number. We define the $\ell$-Genocchi numbers by $G_n:=\ell(1-\ell^n)B_n$, with $B_n$ the $n$-th Bernoulli number. They are integers. We introduce and study a variant of Kummer's notion of regularity of primes. We say that an odd prime $p$ is $\ell$-Genocchi irregular if it divides at least one of the $\ell$-Genocchi numbers $G_2,G_4,\ldots, G_{p-3}$, and $\ell$-regular otherwise. With the help of techniques used in the study of Artin's primitive root conjecture, we give asymptotic estimates for the number of $\ell$-Genocchi irregular primes in a prescribed arithm…
An analogue of Ramanujan's identity for Bernoulli-Carlitz numbers
本文证明了在函数域设定下的拉马努金恒等式类比，涉及伯努利-卡尔利茨数。
Let p be an odd prime. Let K = Q(zeta) be the p-cyclotomic field. Let v be any primitive root mod p. Let sigma be a Q-isomorphism of K. Let P(sigma) = sigma^{p-2}v^{-(p-2)}+ ... + sigma v^{-1} +1 \in Z[G] where 1 \leq v^n \leq p-1 is a notation mod p. We apply a Kummer and Stickelberger relation of K to some singular not primary numbers A of K connected to p-class group C_p of K and prove they verify the congruence A^P(sigma) = 1 mod p^2. This p-adic method on singular numbers A allows us to prove: in a straightforward way the connection between relative p-class group C_p^- and the solutions o…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。