✦ LIBER ✦

Binomial Coefficients and Lucas Sequences

✍ Scribed by Achim Flammenkamp; Florian Luca

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 226 KB
Volume: 93
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.2001.2721

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gauss Sums and Binomial Coefficients

✍ Dong Hoon Lee; Sang Geun Hahn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Lotteries and truncated binomial coeffic

Lotteries and truncated binomial coefficients

✍ Zoltán Sasvári; Michael Kücken 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

## Abstract We consider the expression and investigate for which __k__ and __n__ is __P__(__k__, __n__) an integer. We find integer solutions __k__ and __m__ of the equation __P__(__k__, __n__) = __m__ for a given integer __m__ and approximate real solutions __x__ = __x__(__k__) of the equation __

Combinatorial Identities and Inverse Bin

Combinatorial Identities and Inverse Binomial Coefficients

✍ Toufik Mansour 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 80 KB

In this paper, we present a method for obtaining a wide class of combinatorial identities. We give several examples; some of them have already been considered previously, and others are new.  2002 Elsevier Science (USA)

Transcendence of Binomial and Lucas' For

Transcendence of Binomial and Lucas' Formal Power Series

✍ J.-P Allouche; D Gouyou-Beauchamps; G Skordev 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 120 KB

is transcendental over ‫ޑ‬ X when t is an integer G 2. This is due to Stanley for t even, and independently to Flajolet and to Woodcock and Sharif for the general case. While Stanley and Flajolet used analytic methods and studied the asymptotics of the coefficients of this series, Woodcock and Shari

Computation of Clebsch-Gordan and Gaunt

Computation of Clebsch-Gordan and Gaunt Coefficients Using Binomial Coefficients

✍ I.I. Guseinov; A. Özmen; Ü. Atav; H. Yüksel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Using binomial coefficients the Clebsch-Gordan and Gaunt coefficients were calculated for extremely large quantum numbers. The main advantage of this approach is directly calculating these coefficients, instead of using recursion relations. Accuracy of the results is quite high for quantum numbers \

Binomial Coefficients and Zero-Sum Ramse

Binomial Coefficients and Zero-Sum Ramsey Numbers

✍ Yair Caro 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 307 KB

A counting argument is developed and divisibility properties of the binomial coefficients are combined to prove, among other results, that where K n , resp. K k n , is the complete, resp. complete k-uniform, hypergaph and R(K n , Z p ), R(K k n , Z 2 ) are the corresponding zero-sum Ramsey numbers.