Results 1 to 10 of about 41,390 (232)
A Fast Algorithm for Computing Binomial Coefficients Modulo Powers of Two [PDF]
I present a new algorithm for computing binomial coefficients modulo . The proposed method has an preprocessing time, after which a binomial coefficient with can be computed modulo in time.
Mugurel Ionut Andreica
doaj +2 more sources
Generating binomial coefficients in a row of Pascal's triangle from extensions of powers of eleven [PDF]
Sir Isaac Newton noticed that the values of the first five rows of Pascal's triangle are each formed by a power of 11, and claimed that subsequent rows can also be generated by a power of 11.
Md. Shariful Islam +3 more
doaj +2 more sources
Sums involving the binomial coefficients, Bernoulli numbers of the second kind and harmonic numbers [PDF]
We offer a number of various finite and infinite sum identities involving the binomial coefficients, Bernoulli numbers of the second kind and harmonic numbers. For example, among many others, we prove Σⁿₖ₌ₒ((-1)ᵏhₖ/4ᵏ)$binom{2k}{k}$Gₙ₋ₖ = ((-1)ⁿ⁻¹/2^²ⁿ⁻¹)
Necdet Batır, Anthony Sofo
doaj +1 more source
Convolution identities involving the central binomial coefficients and Catalan numbers [PDF]
We generalize some convolution identities due to Witula and Qi et al. involving the central binomial coefficients and Catalan numbers. Our formula allows us to establish many new identities involving these important quantities, and recovers some ...
Necdet Batır, Hakan Kucuk, Sezer Sorgun
doaj +1 more source
Dirichlet series and series with Stirling numbers
This paper presents a number of identities for Dirichlet series and series with Stirling numbers of the first kind. As coefficients for the Dirichlet series we use Cauchy numbers of the first and second kinds, hyperharmonic numbers, derangement numbers ...
Khristo Boyadzhiev
doaj +1 more source
A class of symmetric and non-symmetric band matrices via binomial coefficients
Symmetric matrix classes of bandwidth 2r + 1 was studied in 1972 through binomial coefficients. In this paper, non-symmetric matrix classes with the binomial coefficients are considered where r + s + 1 is the bandwidth, r is the lower bandwidth and s is ...
Micheal Omojola, Kilic Emrah
doaj +1 more source
Generalized double Fibonomial numbers
From the beginning of 20th century, generalization of binomial coefficient has been deliberated broadly. One of the most famous generalized binomial coefficients are Fibonomial coefficients, obtained by substituting Fibonacci numbers in place of natural ...
Mansi Shah, Shah Devbhadra
doaj +1 more source
The p-Adic Valuations of Sums of Binomial Coefficients
In this paper, we prove three supercongruences on sums of binomial coefficients conjectured by Z.-W. Sun. Let p be an odd prime and let h∈ℤ with 2h−1≡0modp. For a∈ℤ+ and pa>3, we show that ∑k=0pa−1hpa−1k2kk−h/2k≡0modpa+1. Also, for any n∈ℤ+, we have νp∑k=
Yong Zhang, Peisen Yuan
doaj +1 more source
Degenerate binomial coefficients and degenerate hypergeometric functions
In this paper, we investigate degenerate versions of the generalized pth order Franel numbers which are certain finite sums involving powers of binomial coefficients.
Taekyun Kim +3 more
doaj +1 more source
Binomial Sum Relations Involving Fibonacci and Lucas Numbers
In this paper, we provide a first systematic treatment of binomial sum relations involving (generalized) Fibonacci and Lucas numbers. The paper introduces various classes of relations involving (generalized) Fibonacci and Lucas numbers and different ...
Kunle Adegoke +2 more
doaj +1 more source

