二项式系数幂和序列在模p2下的几个性质

利用同余理论和多项式理论研究二项式系数幂和序列在模p2下的同余性质,得到了一些非平凡结果.为进一步研究二项式系数幂和序列的多项式递推公式提供有利的工具.     

二项式系数幂和序列的几个性质

利用同余理论研究二项式系数的幂和序列bn(r)=∑nk=1nkink-1r-i在modp下的同余性质,这将为研究序列an(r)=∑nnkr的多项式递推公式提供有利工具.     

有关自然数方幂和公式系数的一个新的递推公式

研究了自然数方幂和的表示公式 ,给出了其系数的一个递推关系式 ,利用递推公式很容易得到幂和的各项系数 ,为计算机解题提供了依据 .     

二项式系数和序列的同余性质

利用同余理论研究了二项式系数和序列an（r,s）和bn（ε,a,b,c）分别在模p^2和模p^3下的同余性质,这将为研究它们的多项式递推公式提供有利的工具.     

自然数等幂和的一个新的通项递归公式

从几何观点出发,利用二项式定理推导出自然数等幂和的一个新的通项递归公式,比已有的组合逼近式、递推式更简洁有效.     

二元变系数递推数列的求解

运用矩阵理论给出一类二元变系数递推数列的求解公式,此方法适用于变系数分式递推式及m元变系数递推式的求解问题。     

关于幂和问题的新结果

本文获得了幂和公式中系数的递推关系式及幂和公式的一个新的性质。     

关于幂和公式系数的一个递推关系式

本文给出幂和公式中的系数的一个递推关系式 ,并且还得到直接计算系数及把系数表为因式乘积的两个推论 .     

借助二项式系数求解行列式

本文借助二项式系数求解一类元素有幂次、排列有规律的行列式.阐述了解题思想及方法,指出了解题时应注意的问题,并通过具体例子说明运用本文方法的简便性.     

二项式的幂与递推数列

以共轭根式为基本出发点,通过探究二项式的幂与递推数列之间的内在联系,统一解决了两类相关问题.     

Divisibility properties of a class of binomial sums

We study congruence and divisibility properties of a class of combinatorial sums that involve products of powers of two binomial coefficients, and show that there is a close relationship between these sums and the theorem of Wolstenholme. We also establish congruences involving Bernoulli numbers, and finally we prove that under certain conditions the sums are divisible by all primes in specific intervals.     

包含幂和二项式系数倒数的等式

In this paper,we give several identities of finite sums and some infinite series involving powers and inverse of binomial coefficients,which extends the results of T.Trif.     

On recurrences for sums of powers of binomial coefficients

The recurrence for sums of powers of binomial coefficients is considered and a lower bound for the minimal length of the recurrence is obtained by using the properties of congruence.

Video abstract

For a video summary of this paper, please visit http://www.youtube.com/watch?v=jwy6B4aYR-Q.     

Extremal Properties of Sums of Binomial Coefficients

Some extremal problems for the sums of binomial coefficients that arise in research on estimating the computational complexity of discrete optimization algorithms are examined. These extremal problems are solved using the theory of majorization and useful inequalities are introduced for the sums of binomial coefficients.     

Some recurrences for sums of powers of binomial coefficients

Recently, interest has been sparked in recurrences for sums of powers of binomial coefficients. We will present four-term recurrences for Σ_{k = 0}ⁿ (_kⁿ)^r r = 5, 6.     

Exponential sums with Catalan numbers and middle binomial coefficients

We estimate the number of solutions of certain congruences with Catalan numbers and middle binomial coefficients modulo a prime. We use these results to bound double exponential sums with products of two Catalan numbers and two middle binomial coefficients, respectively, which in turn lead us to upper bounds on single exponential sums.     

Bounds of the accuracy of the normal approximation to the distributions of random sums under relaxed moment conditions<Superscript>∗</Superscript>

We improve bounds of accuracy of the normal approximation to the distribution of a sum of independent random variables under relaxed moment conditions, in particular, under the absence of moments of orders higher than the second. We extend these results to Poisson binomial, binomial, and Poisson random sums. Under the same conditions, we obtain bounds for the accuracy of approximation of the distributions of mixed Poisson random sums by the corresponding limit law. In particular, we construct these bounds for the accuracy of approximation of the distributions of geometric, negative binomial, and Poisson-inverse gamma (Sichel) random sums by the Laplace, variance gamma, and Student distributions, respectively.     

Seven equivalent binomial sums

Seven binomial sums including four of Ruehr (1980) are shown to be equipollent by means of the Lambert series on binomial coefficients.     

Summation formula involving harmonic numbers

Some identities of sums associated with harmonic numbers and binomial coefficients are developed. Integral representations and closed form identities of these sums are also given.     

Bernoulli numbers and sums of powers

There have been many studies of Bernoulli numbers since Jakob Bernoulli first used the numbers to compute sums of powers, 1 ^p + 2 ^p + 3 ^p + ··· + n^p , where n is any natural number and p is any non-negative integer. By examining patterns of these sums for the first few powers and the relation between their coefficients and Bernoulli numbers, the author hypothesizes and proves a new recursive algorithm for computing Bernoulli numbers, sums of powers, as well as m-ford sums of powers, which enrich the existing literatures of Bernoulli numbers.