April 21, 2004
In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For example, we show that if $n\ge m-1$ then $$\sum_{i=0}^{\lfloor(m-1)/2\rfloor}(-1)^i\binom{m-1-i}i [n-2i,r-i]_m=2^{n-m+1}.$$ We also apply such results to investigate Bernoulli and Euler polynomials. Our approach depends heavily on an identity established by the author [Integers 2(2002)].
Similar papers 1
February 20, 2014
In this paper we continue to investigate the properties of those sequences $\{a_n\}$ satisfying the condition $\sum_{k=0}^n\binom nk(-1)^ka_k=\pm a_n$ $(n\ge 0)$. As applications we deduce new recurrence relations and congruences for Bernoulli and Euler numbers.
October 19, 2017
We present various identities involving the classical Bernoulli and Euler polynomials. Among others, we prove that $$ \sum_{k=0}^{[n/4]}(-1)^k {n\choose 4k}\frac{B_{n-4k}(z) }{2^{6k}} =\frac{1}{2^{n+1}}\sum_{k=0}^{n} (-1)^k \frac{1+i^k}{(1+i)^k} {n\choose k}{B_{n-k}(2z)} $$ and $$ \sum_{k=1}^{n} 2^{2k-1} {2n\choose 2k-1} B_{2k-1}(z) = \sum_{k=1}^n k \, 2^{2k} {2n\choose 2k} E_{2k-1}(z). $$ Applications of our results lead to formulas for Bernoulli and Euler numbers, like, for...
September 22, 2019
In this paper we present several natural $q$-analogues of the poly-Bernoulli numbers arising in combinatorial contexts. We also recall some relating analytical results and ask for combinatorial interpretations.
March 26, 2013
The modified Bernoulli numbers \begin{equation*} B_{n}^{*} = \sum_{r=0}^{n} \binom{n+r}{2r} \frac{B_{r}}{n+r}, \quad n > 0 \end{equation*} introduced by D. Zagier in 1998 were recently extended to the polynomial case by replacing $B_{r}$ by the Bernoulli polynomials $B_{r}(x)$. Arithmetic properties of the coefficients of these polynomials are established. In particular, the 2-adic valuation of the modified Bernoulli numbers is determined. A variety of analytic, umbral, and a...
September 2, 2004
We establish two general identities for Bernoulli and Euler polynomials, which are of a new type and have many consequences. The most striking result in this paper is as follows: If $n$ is a positive integer, $r+s+t=n$ and $x+y+z=1$, then we have $$rF(s,t;x,y)+sF(t,r;y,z)+tF(r,s;z,x)=0$$ where $$F(s,t;x,y):=\sum_{k=0}^n(-1)^k\binom{s}{k}\binom{t}{n-k}B_{n-k}(x)B_k(y).$$ This symmetric relation implies the curious identities of Miki and Matiyasevich as well as some new identit...
July 2, 2014
Let $p>3$ be a prime, and let $a$ be a rational p-adic integer. Let $\{B_n(x)\}$ and $\{E_n(x)\}$ denote the Bernoulli polynomials and Euler polynomials, respectively. In this paper we show that $$\sum_{k=0}^{p-1}\binom ak\binom{-1-a}k\equiv (-1)^{\langle a\rangle_p}+ p^2t(t+1)E_{p-3}(-a)\pmod{p^3}$$ and for $a\not\equiv -\frac 12\pmod p$, $$\sum_{k=0}^{p-1}\binom ak\binom{-1-a}k\frac 1{2k+1}\equiv \frac{1+2t}{1+2a} +p^2\frac{t(t+1)}{1+2a}B_{p-2}(-a)\pmod{p^3},$$ where $\lang...
November 29, 2022
Let $[x]$ be the integral part of $x$, $n>1$ be a positive integer and $\chi_n$ denote the trivial Dirichlet character modulo $n$. In this paper, we use an identity established by Z. H. Sun to get congruences of $T_{m,k}(n)=\sum_{x=1}^{[n/m]}\frac{\chi_n(x)}{x^k}\left(\bmod n^{r+1}\right)$ for $r\in \{1,2\}$, any positive integer $m $ with $n \equiv \pm 1 \left(\bmod m \right)$ in terms of Bernoulli polynomials. As its an application, we also obtain some new congruences invol...
January 12, 2014
In this paper we introduce the generalization of Multi Poly-Euler polynomials and we investigate some relationship involving Multi Poly-Euler polynomials. Obtaining a closed formula for generalization of Multi Poly-Euler numbers therefore seems to be a natural and important problem.
May 5, 2008
Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p. For example, we show that if $p\not=2,5$ then $$\sum_{k=1}^{p-1}(-1)^k\frac{\binom{2k}k}k=-5\frac{F_{p-(\frac p5)}}p (mod p),$$ where F_n is the n-th Fibonacci number and (-) is the Jacobi symbol. We also prove that if p>3 then $$\sum_{k=1...
June 10, 2021
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.