Some congruences on harmonic numbers and binomial sums

Some new congruences on harmonic numbers are established. In addition, we obtain a congruence of binomial sums, which is a generalization of that of van Hamme and confirms a conjecture of Swisher.     

Generic twisted T -adic exponential sums of binomials

The twisted T -adic exponential sum associated with xd + λx is studied. If λ = 0, then an explicitarithmetic polygon is proved to be the Newton polygon of the C-function of the twisted T-adic exponential sum.It gives the Newton polygons of the L-functions of twisted p-power order exponential sums.     

On some congruences of certain binomial sums

For any prime \(p>3,\) we prove that

$$\begin{aligned} \sum _{k=0}^{p-1}\frac{3k+1}{(-8)^k}{2k\atopwithdelims ()k}^3\equiv p\left( \frac{-1}{p}\right) +p^3E_{p-3}\pmod {p^4}, \end{aligned}$$

where \(E_{0},E_{1},E_{2},\ldots \) are Euler numbers and \(\left( \frac{\cdot }{p}\right) \) is the Legendre symbol. This result confirms a conjecture of Z.-W. Sun. We also re-prove that for any odd prime \(p,\)

$$\begin{aligned} \sum _{k=0}^{\frac{p-1}{2}}\frac{6k+1}{(-512)^k}{2k\atopwithdelims ()k}^3\equiv p\left( \frac{-2}{p}\right) \pmod {p^2} \end{aligned}$$

using WZ method.

     

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

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

Linear congruence relations for 2-adic L-series at integers

In the paper we find a further generalization of congruences of the K. Hardy and K. S. Williams [5] type which seems to be a full generalization of congruences of G. Gras [4]. Moreover we extend results of [5], [7], [8], [9] and in part of [6]. We apply ideas and methods of [2], [7] and [9].     

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

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

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.     

On some congruence with application to exponential sums

We will study the solution of a congruence,x ≡g ^1/2)ωg(2 ⁿ ) mod 2 ⁿ , depending on the integersg andn, where ω _g (2 ⁿ ) denotes the order ofg modulo 2 ⁿ . Moreover, we introduce an application of the above result to the study of an estimation of exponential sums.     

Congruences for certain binomial sums

We exploit the properties of Legendre polynomials defined by the contour integral ${{\rm{P}}_n}(z) = {(2{\rm{\pi i}})^{ - 1}}\oint {{{(1 - 2tz + {t^2})}^{ - 1/2}}{t^{ - n - 1}}{\rm{d}}t} $ , where the contour encloses the origin and is traversed in the counterclockwise direction, to obtain congruences of certain sums of central binomial coefficients. More explicitly, by comparing various expressions of the values of Legendre polynomials, it can be proved that for any positive integer r, a prime p ?5 and n = rp ² ? 1, we have $\sum\limits_{k = 0}^{\left\lfloor {n/2} \right\rfloor } {(_k^{2k} ) \equiv 0,1} $ or ?1 (mod p ²), depending on the value of r (mod 6).     

Sets with even partition functions and 2-adic integers

For P ? \(\mathbb{F}_2 \)[z] with _P(0) = 1 and deg(_P) ≥ 1, let \(\mathcal{A}\) = \(\mathcal{A}\)(P) (cf. [4], [5], [13]) be the unique subset of ? such that Σ _n≥0 p(\(\mathcal{A}\), n)z ⁿ ≡ P(z) (mod 2), where p(\(\mathcal{A}\), n) is the number of partitions of n with parts in \(\mathcal{A}\). Let p be an odd prime and P ? \(\mathbb{F}_2 \)[z] be some irreducible polynomial of order p, i.e., p is the smallest positive integer such that P(z) divides 1 + z ^p in \(\mathbb{F}_2 \)[z]. In this paper, we prove that if m is an odd positive integer, the elements of \(\mathcal{A}\) = \(\mathcal{A}\)(P) of the form 2 ^k m are determined by the 2-adic expansion of some root of a polynomial with integer coefficients. This extends a result of F. Ben Saïd and J.-L. Nicolas [6] to all primes p.     

Asymptotic Eulerian expansions for binomial and negative binomial reciprocals

Asymptotic expansions of any order for expectations of inverses of random variables with positive binomial and negative binomial distributions are obtained in terms of the Eulerian polynomials. The paper extends and improves upon an expansion due to David and Johnson (1956-7).

     

Some evaluation of harmonic number sums

In this paper, by using the method of partial fraction decomposition and integral representations of series, we establish some expressions of series involving harmonic numbers and binomial coefficients in terms of zeta values and harmonic numbers. Furthermore, we can obtain some closed form representations of sums of products of quadratic (or cubic) harmonic numbers and reciprocal binomial coefficients, and some explicit evaluations are given as applications. The given representations are new.     

Analysis of the Bernstein basis functions: an approach to combinatorial sums involving binomial coefficients and Catalan numbers

We give some alternative forms of the generating functions for the Bernstein basis functions. Using these forms,we derive a collection of functional equations for the generating functions. By applying these equations, we prove some identities for the Bernstein basis functions. Integrating these identities, we derive a variety of identities and formulas, some old and some new, for combinatorial sums involving binomial coefficients, Pascal's rule, Vandermonde's type of convolution, the Bernoulli polynomials, and the Catalan numbers. Copyright © 2014 John Wiley & Sons, Ltd.     

Computation methods for combinatorial sums and Euler‐type numbers related to new families of numbers

The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order. We can show that these numbers are related to the well‐known numbers and polynomials such as the Stirling numbers of the second kind and the central factorial numbers, the array polynomials, the rook numbers and polynomials, the Bernstein basis functions and others. In order to derive our new identities and relations for these numbers, we use a technique including the generating functions and functional equations. Finally, we give not only a computational algorithm for these numbers but also some numerical values of these numbers and the Euler numbers of negative order with tables. We also give some combinatorial interpretations of our new numbers. Copyright © 2016 John Wiley & Sons, Ltd.     

Congruences for sums of binomial coefficients

Let q>1 and m>0 be relatively prime integers. We find an explicit period νm(q) such that for any integers n>0 and r we have

     

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.     

Asymptotic factorial powers expansions for binomial and negative binomial reciprocals

By considering the variance formula for a shifted reciprocal of a binomial proportion, the asymptotic expansions of any order for first negative moments of binomial and negative binomial distributions truncated at zero are obtained. The expansions are given in terms of the factorial powers of the number of trials . The obtained formulae are more accurate than those of Marciniak and Wesoowski (1999) and simpler, as they do not involve the Eulerian polynomials.