𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Negation of binomial coefficients

✍ Scribed by Renzo Sprugnoli

Book ID
108113917
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
139 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Inequalities for Binomial Coefficients
Inequalities for Binomial Coefficients
✍ ZoltΓ‘n SasvΓ‘ri πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 41 KB

Let r ) 1 and s ) 0 be arbitrary real numbers. Using Stirling's formula, n n Ε½ n.

Modular periodicity of binomial coeffici
Modular periodicity of binomial coefficients
✍ Sandro Mattarei πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 160 KB

We prove that if the signed binomial coefficient (-1) i k i viewed modulo p is a periodic function of i with period h in the range 0 i k, then k + 1 is a power of p, provided h is not too large compared to k. (In particular, 2h k suffices). As an application, we prove that if G and H are multiplicat

On divisibility of binomial coefficients
On divisibility of binomial coefficients
✍ Marko Razpet πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 141 KB

The Lucas theorem for binomial coefficients implies some interesting tensor product properties of certain matrices regarded for every prime p in the field TP. Let us define the array of numbers C(i,j) for all nonnegative integers i and j by binomial coefficients: ## 0 _i ' We may display the numb

Some binomial coefficient congruences
Some binomial coefficient congruences
✍ D.F. Bailey πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 297 KB

For p prime and i < p, i # 0, (r;Ti) I (r + l)(r;l) (y) (mod p2). A parallel, but rather different congruence holds modulo p3. In 1878, kdouard Lucas gave an elegant result for computing binomial coefficients modulo a prime [1,2]. H is result is as follows.