English
Related papers

Related papers: A two-sided Faulhaber-like formula involving Berno…

200 papers

We show that each member of a doubly infinite sequence of highly nonlinear expressions of Bernoulli polynomials, which can be seen as linear combinations of certain higher-order convolutions, is a multiple of a specific product of linear…

Number Theory · Mathematics 2019-03-29 Karl Dilcher , Armin Straub , Christophe Vignat

We give a new proof of Milne's formulas for the number of representations of an integer as a sum of 4m^2 and 4m(m+1) squares. The proof is based on explicit evaluation of pfaffians with elliptic function entries, and relates Milne's…

Number Theory · Mathematics 2009-01-30 Hjalmar Rosengren

Tuenter [Fibonacci Quarterly 40 (2002), 175-180] and other authors have considered centred binomial sums of the form \[S_r(n) = \sum_k \binom{2n}{k}|n-k|^r,\] where $r$ and $n$ are non-negative integers. We consider sums of the form…

Combinatorics · Mathematics 2015-01-28 Richard P. Brent

For any number $m \equiv 0,1 \, (4)$ we correct the generating function of Hurwitz class number sums $\sum_r H(4n - mr^2)$ to a modular form (or quasimodular form if $m$ is a square) of weight two for the Weil representation attached to a…

Number Theory · Mathematics 2018-09-28 Brandon Williams

We give nontrivial bounds for the bilinear sums $$ \sum_{u = 1}^{U} \sum_{v=1}^V \alpha_u \beta_v \mathbf{\,e}_p(u/f(v)) $$ where $\mathbf{\,e}_p(z)$ is a nontrivial additive character of the prime finite field ${\mathbb F}_p$ of $p$…

Number Theory · Mathematics 2016-05-25 Igor E. Shparlinski

We prove formulas for the Bernoulli numbers by using the Newton-Girard identities to evaluate the Riemann zeta function at positive even integers. To do this, we define a sequence of positive integers, a sequence of polynomials, and a…

Number Theory · Mathematics 2019-12-13 Mario DeFranco

What is a general expression for the sum of the first n integers, each raised to the mth power, where m is a positive integer? Answering this question will be the aim of the paper....We will take the unorthodox approach of presenting the…

General Mathematics · Mathematics 2019-01-14 Ryan Zielinski

In this paper we completely solve the Diophantine equation $F_n+F_m=2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$, where $F_k$ denotes the $k$-th Fibonacci number. In addition to complex linear forms in logarithms and the Baker-Davenport…

Number Theory · Mathematics 2021-04-27 Ingrid Vukusic , Volker Ziegler

We derive weighted sums, including binomial and double binomial sums, for the generalized Fibonacci sequence $\{G_m\}$ where for $m\ge 2$, $G_m=G_{m-1}+G_{m-2}$ with initial values $G_0$ and $G_1$.

Classical Analysis and ODEs · Mathematics 2018-05-07 Kunle Adegoke

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Combinatorics · Mathematics 2008-01-19 Milan Janjic

Infinite series sum_{n=1}^infty {(alpha/2)_n / (n n!)}_1F_1(-n, gamma, x^2), where_1F_1(-n, gamma, x^2)={n!_(gamma)_n}L_n^(gamma-1)(x^2), appear in the first-order perturbation correction for the wavefunction of the generalized spiked…

Mathematical Physics · Physics 2009-11-07 Richard L. Hall , Nasser Saad , Attila B. von Keviczky

Let $p>3$ be a prime, and let $a$ be a rational p-adic integer with $a\not\equiv 0\pmod p$. In this paper we establish congruences for $$\sum_{k=1}^{(p-1)/2}\frac{\binom ak\binom{-1-a}k}k, \quad\sum_{k=0}^{(p-1)/2}k\binom ak\binom{-1-a}k…

Number Theory · Mathematics 2016-05-31 Zhi-Hong Sun

Let $a, b\in \mathbb{N}$ be relatively prime. Previous work showed that exactly one of the two equations $ax + by = (a-1)(b-1)/2$ and $ax + by + 1 = (a-1)(b-1)/2$ has a nonnegative, integral solution; furthermore, the solution is unique.…

Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.

Combinatorics · Mathematics 2016-10-10 Khristo N. Boyadzhiev

A lonesum matrix is a matrix that can be uniquely reconstructed from its row and column sums. Kaneko defined the poly-Bernoulli numbers $B_m^{(n)}$ by a generating function, and Brewbaker computed the number of binary lonesum $m\times…

Combinatorics · Mathematics 2017-01-20 Hyun Kwang Kim , Denis S. Krotov , Joon Yop Lee

Recently, Guo and Zeng discovered q-analogues of Faulhaber's formulas for the sums of powers. They left it as an open problem to extend the combinatorial interpretation of Faulhaber's formulas as given by Gessel and Viennot to the q case.…

Combinatorics · Mathematics 2016-09-07 Martin Rubey

Let q>1 and m>0 be relatively prime integers. We find an explicit period $\nu_m(q)$ such that for any integers n>0 and r we have $[n+\nu_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q),…

Number Theory · Mathematics 2007-08-06 Zhi-Wei Sun , Roberto Tauraso

The central binomial series at negative integers are expressed as a linear combination of values of certain two polynomials. We show that one of the polynomials is a special value of the bivariate Eulerian polynomial and the other…

Number Theory · Mathematics 2022-07-04 Beáta Bényi , Toshiki Matsusaka

Let $B_{n}$ denote the Bernoulli numbers, and $S(n,k)$ denote the Stirling numbers of the second kind. We prove the following identity $$ B_{m+n}=\sum_{\substack{0\leq k \leq n \\ 0\leq l \leq m}}\frac{(-1)^{k+l}\,k!\, l!\,…

General Mathematics · Mathematics 2020-09-24 Sumit Kumar Jha

Using notions of composita and composition of generating functions we obtain explicit formulas for Chebyshev polynomials, Legendre polynomials, Gegenbauer polynomials, Associated Laguerre polynomials, Stirling polynomials, Abel polynomials,…

Number Theory · Mathematics 2012-11-02 Vladimir Kruchinin , Dmitry Kruchinin