246 research outputs found

    On the asymptotic normality of the Legendre-Stirling numbers of the second kind

    Full text link
    For the Legendre-Stirling numbers of the second kind asymptotic formulae are derived in terms of a local central limit theorem. Thereby, supplements of the recently published asymptotic analysis of the Chebyshev-Stirling numbers are established. Moreover, we provide results on the asymptotic normality and unimodality for modified Legendre-Stirling numbers

    Lucas' theorem: its generalizations, extensions and applications (1878--2014)

    Full text link
    In 1878 \'E. Lucas proved a remarkable result which provides a simple way to compute the binomial coefficient (nm){n\choose m} modulo a prime pp in terms of the binomial coefficients of the base-pp digits of nn and mm: {\it If pp is a prime, n=n0+n1p++nspsn=n_0+n_1p+\cdots +n_sp^s and m=m0+m1p++mspsm=m_0+m_1p+\cdots +m_sp^s are the pp-adic expansions of nonnegative integers nn and mm, then \begin{equation*} {n\choose m}\equiv \prod_{i=0}^{s}{n_i\choose m_i}\pmod{p}. \end{equation*}} The above congruence, the so-called {\it Lucas' theorem} (or {\it Theorem of Lucas}), plays an important role in Number Theory and Combinatorics. In this article, consisting of six sections, we provide a historical survey of Lucas type congruences, generalizations of Lucas' theorem modulo prime powers, Lucas like theorems for some generalized binomial coefficients, and some their applications. In Section 1 we present the fundamental congruences modulo a prime including the famous Lucas' theorem. In Section 2 we mention several known proofs and some consequences of Lucas' theorem. In Section 3 we present a number of extensions and variations of Lucas' theorem modulo prime powers. In Section 4 we consider the notions of the Lucas property and the double Lucas property, where we also present numerous integer sequences satisfying one of these properties or a certain Lucas type congruence. In Section 5 we collect several known Lucas type congruences for some generalized binomial coefficients. In particular, this concerns the Fibonomial coefficients, the Lucas uu-nomial coefficients, the Gaussian qq-nomial coefficients and their generalizations. Finally, some applications of Lucas' theorem in Number Theory and Combinatorics are given in Section 6.Comment: 51 pages; survey article on Lucas type congruences closely related to Lucas' theore

    On the interplay between hypergeometric series, Fourier-Legendre expansions and Euler sums

    Full text link
    In this work we continue the investigation about the interplay between hypergeometric functions and Fourier-Legendre (FL\textrm{FL}) series expansions. In the section "Hypergeometric series related to π,π2\pi,\pi^2 and the lemniscate constant", through the FL-expansion of [x(1x)]μ\left[x(1-x)\right]^\mu (with μ+114N\mu+1\in\frac{1}{4}\mathbb{N}) we prove that all the hypergeometric series n0(1)n(4n+1)p(n)[14n(2nn)]3,n0(4n+1)p(n)[14n(2nn)]4, \sum_{n\geq 0}\frac{(-1)^n(4n+1)}{p(n)}\left[\frac{1}{4^n}\binom{2n}{n}\right]^3,\quad \sum_{n\geq 0}\frac{(4n+1)}{p(n)}\left[\frac{1}{4^n}\binom{2n}{n}\right]^4, n0(4n+1)p(n)2[14n(2nn)]4,  n01p(n)[14n(2nn)]3,  n01p(n)[14n(2nn)]2\quad \sum_{n\geq 0}\frac{(4n+1)}{p(n)^2}\left[\frac{1}{4^n}\binom{2n}{n}\right]^4,\; \sum_{n\geq 0}\frac{1}{p(n)}\left[\frac{1}{4^n}\binom{2n}{n}\right]^3,\; \sum_{n\geq 0}\frac{1}{p(n)}\left[\frac{1}{4^n}\binom{2n}{n}\right]^2 return rational multiples of 1π,1π2\frac{1}{\pi},\frac{1}{\pi^2} or the lemniscate constant, as soon as p(x)p(x) is a polynomial fulfilling suitable symmetry constraints. Additionally, by computing the FL-expansions of logxx\frac{\log x}{\sqrt{x}} and related functions, we show that in many cases the hypergeometric p+1Fp(,z)\phantom{}_{p+1} F_{p}(\ldots , z) function evaluated at z=±1z=\pm 1 can be converted into a combination of Euler sums. In particular we perform an explicit evaluation of n01(2n+1)2[14n(2nn)]2,n01(2n+1)3[14n(2nn)]2. \sum_{n\geq 0}\frac{1}{(2n+1)^2}\left[\frac{1}{4^n}\binom{2n}{n}\right]^2,\quad \sum_{n\geq 0}\frac{1}{(2n+1)^3}\left[\frac{1}{4^n}\binom{2n}{n}\right]^2. In the section "Twisted hypergeometric series" we show that the conversion of some p+1Fp(,±1)\phantom{}_{p+1} F_{p}(\ldots,\pm 1) values into combinations of Euler sums, driven by FL-expansions, applies equally well to some twisted hypergeometric series, i.e. series of the form n0anbn\sum_{n\geq 0} a_n b_n where ana_n is a Stirling number of the first kind and n0bnzn=p+1Fp(;z)\sum_{n\geq 0}b_n z^n = \phantom{}_{p+1} F_{p}(\ldots;z)
    corecore