中文
相关论文

相关论文: On a combinatorial identity of Chaundy and Bullard

200 篇论文

Recently, by the Riordan's identity related to tree enumerations, \begin{eqnarray*} \sum_{k=0}^{n}\binom{n}{k}(k+1)!(n+1)^{n-k} &=& (n+1)^{n+1}, \end{eqnarray*} Sun and Xu derived another analogous one, \begin{eqnarray*}…

组合数学 · 数学 2010-07-09 Yidong Sun , Jujuan Zhuang

An identity by Chaundy and Bullard writes 1/(1-x)^n (n=1,2,...) as a sum of two truncated binomial series. This identity was rediscovered many times. Notably, a special case was rediscovered by I. Daubechies, while she was setting up the…

经典分析与常微分方程 · 数学 2009-02-20 Tom H. Koornwinder , Michael J. Schlosser

An identity by Chaundy and Bullard writes 1/(1-x)^n (n=1,2,...) as a sum of two truncated binomial series. In a paper which appeared in 2008 in Indag. Math. the authors surveyed many aspects of this identity. In the present paper we discuss…

经典分析与常微分方程 · 数学 2012-11-30 Tom H. Koornwinder , Michael J. Schlosser

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…

数论 · 数学 2008-07-14 Zhi-Wei Sun

In this work we prove a new combinatorial identity and applying it we establish many finite harmonic sum identities. Among many others, we prove that \begin{equation*}…

组合数学 · 数学 2018-06-11 Necdet Batir

In this paper we obtain a new curious identity involving trigonometric functions. Namely, for any positive odd integer $n$ we prove that $$\sum_{k=1}^n(-1)^k(\cot kx)\sin k(n-k)x=\frac{1-n}2,$$ which is equivalent to the identity…

组合数学 · 数学 2024-10-08 Zhi-Wei Sun , Hao Pan

By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…

数论 · 数学 2011-03-25 Victor J. W. Guo , Jiang Zeng

The identity by Chaundy and Bullard expresses $1$ as a sum of two truncated binomial series in one variable where the truncations depend on two different non-negative integers. We present basic and elliptic extensions of the…

组合数学 · 数学 2025-07-21 Natsuko Hoshi , Makoto Katori , Tom H. Koornwinder , Michael J. Schlosser

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

数论 · 数学 2012-04-10 Victor J. W. Guo , Jiang Zeng

The summation formula $$ \sum^{n-1}_{i=0}\epsilon^i i! (i^k+u_k) = v_k+\epsilon^{n-1} n! A_{k-1}(n) $$ $(\epsilon=\pm 1; k=1,2,...; u_k, v_k\in \msbm\hbox{Z}; A_{k-1}$ is a polynomial) is derived and its various aspects are considered. In…

数论 · 数学 2007-05-23 Branko Dragovich

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…

We present a different proof of the following identity due to Munarini, which generalizes a curious binomial identity of Simons. \begin{align*} \sum_{k=0}^{n}\binom{\alpha}{n-k}\binom{\beta+k}{k}x^k…

组合数学 · 数学 2023-01-24 Necdet Batir , Sezer Sorgunand Sevda Atpinar

In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack…

数论 · 数学 2015-06-26 Victor J. W. Guo , Frederic Jouhet , Jiang Zeng

In this paper, we establish the following two identities involving the Gamma function and Bernoulli polynomials, namely $$ \sum_{k\leq x}\frac{1}{k^s} \sum_{j=1}^{k^s}\log\Gamma\left(\frac{j}{k^s}\right) \sum_{\substack{d|k \\…

数论 · 数学 2019-12-24 Isao Kiuchi , Sumaia Saad Eddin

Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they…

组合数学 · 数学 2017-07-10 Samantha Dahlberg

We survey combinatorial interpretations of some dozen identities for the double factorial such as, for instance, (2n-2)!! + Sum_{k=2}^{n} (2n-1)!!(2k-4)!!/(2k-1)!! = (2n-1)!!. Our methods are mostly bijective.

组合数学 · 数学 2009-06-09 David Callan

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

组合数学 · 数学 2022-08-03 Harold R. Parks , Dean C. Wills

We prove that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and non-negative integers $j$ and $r$ with $j\leqslant m$, the following two expressions \begin{align*} &\frac{1}{[n_1+n_m+1]}{n_1+n_{m}\brack…

数论 · 数学 2017-05-18 Victor J. W. Guo , Su-Dan Wang

In this manuscript we provide a new polynomial pattern. This pattern allows to find a polynomial expansion of the form \[x^{2m+1} = \sum_{k=1}^{x}\sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r,\] where $x,m\in\mathbb{N}$ and $\mathbf{A}_{m,r}$…

综合数学 · 数学 2022-11-01 Petro Kolosov

A new explicit closed-form formula for the multivariate $(n, k)$th partial Bell polynomial $B_{n,k} (x_1, x_2, ..., x_{n - k + 1})$ is deduced. The formula involves multiple summations and makes it possible, for the first time, to easily…

经典分析与常微分方程 · 数学 2013-01-17 Djurdje Cvijovic
‹ 上一页 1 2 3 10 下一页 ›