On sums of binomial coefficients and their applications

We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain lower triangular built of binomial coefficients. Another words we interpret Euler and Bernoulli numbers in terms of modified Pascal matrices.

In [16], we obtained some congruences for Lucas quotients of two infinite families of Lucas sequences by studying the combinatorial sum $$\sum_{k\equiv r(\mbox{mod}m)}{n\choose k}a^k.$$ In this paper, we show that the sum can be expressed in terms of some recurrent sequences with orders not exceeding $\varphi{(m)}$ and give some new congruences.

We provide a detailed derivation of a new formula for binomial coefficients by harnessing an underexplored property of polynomial encoding. The formula, $\binom{n}{k} = \left\lfloor\frac{(1 + 2^{n})^{n}}{2^{n k}}\right\rfloor \bmod{2^{n}}$, is valid for $n > 0$ and $0 \leq k \leq n$. We relate this formula to existing mathematical methods via Kronecker substitution. To showcase the versatility of our approach, we also apply it to multinomials. A baseline computational complex...

We give a $q$-analogue of some binomial coefficient identities of Y. Sun [Electron. J. Combin. 17 (2010), #N20] as follows: {align*} \sum_{k=0}^{\lfloor n/2\rfloor}{m+k\brack k}_{q^2}{m+1\brack n-2k}_{q} q^{n-2k\choose 2} &={m+n\brack n}_{q}, \sum_{k=0}^{\lfloor n/4\rfloor}{m+k\brack k}_{q^4}{m+1\brack n-4k}_{q} q^{n-4k\choose 2} &=\sum_{k=0}^{\lfloor n/2\rfloor}(-1)^k{m+k\brack k}_{q^2}{m+n-2k\brack n-2k}_{q}, {align*} where ${n\brack k}_q$ stands for the $q$-binomial coeffi...

In this paper we investigate some interesting formulae of q-Euler numbers and polynomials related to the modified q-Bernstein polynomials.

Let $\{B_n\}$, $\{B_n(x)\}$ and $\{E_n(x)\}$ be the Bernoulli numbers, Bernoulli polynomials and Euler polynomials, respectively. In this paper we mainly establish formulas for $\sum_{6\mid k-3}\binom nkB_{n-k}(x)$, $\sum_{6\mid k}\binom nkE_{n-k}(x)$ and $\sum_{6\mid k-3}\binom nkm^kB_{n-k}$ in the cases $m=2,3,4$.

We prove that, if $m,n\geqslant 1$ and $a_1,\ldots,a_m$ are nonnegative integers, then \begin{align*} \frac{[a_1+\cdots+a_m+1]!}{[a_1]!\ldots[a_m]!}\sum^{n-1}_{h=0}q^h\prod_{i=1}^m{h\brack a_i} \equiv 0\pmod{[n]}, \end{align*} where $[n]=\frac{1-q^n}{1-q}$, $[n]!=[n][n-1]\cdots[1]$, and ${a\brack b}=\prod_{k=1}^b\frac{1-q^{a-k+1}}{1-q^k}$. The $a_1=\cdots=a_m$ case confirms a recent conjecture of Z.-W. Sun. We also show that, if $p>\max\{a,b\}$ is a prime, then \begin{align*}...

We give a few remarks on the periodic sequence $a_n=\binom{n}{x}~(mod~m)$ where $x,m,n\in \mathbb{N}$, which is periodic with minimal length of the period being $$\ell(m,x)={\displaystyle\prod^w_{i=1}p^{\lfloor\log_{p_i}x\rfloor+b_i}_i}=m{\displaystyle\prod^w_{i=1}p^{\lfloor\log_{p_i}x\rfloor}_i}$$ where $m=\prod^w_{i=1}p^{b_i}_i$. We prove certain interesting properties of $\ell(m,x)$ and derive a few other results and congruences.

The present paper deals with Bernstein polynomials and Frobenius-Euler numbers and polynomials. We apply the method of generating function and fermionic p-adic integral representation on Zp, which are exploited to derive further classes of Bernstein polynomials and Frobenius-Euler numbers and polynomials. To be more precise we summarize our results as follows, we obtain some combinatorial relations between Frobenius-Euler numbers and polynomials. Furthermore, we derive an int...

Let $\mathbf{P}^{m}_{b}(x)$ be a $2m+1$-degree integer-valued polynomial in $b,x\in\mathbb{R}$ \[ \mathbf{P}^{m}_{b}(x) = \sum_{k=0}^{b-1} \sum_{r=0}^{m} \mathbf{A}_{m,r} k^r(x-k)^r, \] where $\mathbf{A}_{m,r}$ is a real coefficient. In this manuscript we establish a relation between Binomial theorem and polynomial $\mathbf{P}^{m}_{b}(x)$. Furthermore, a relationship between Binomial theorem and discrete convolution in terms of polynomials is provided.