Results 271 to 280 of about 55,236 (313)

On an Identity with Binomial Coefficients

Mathematical Notes, 2019
In the present paper, a new identity associated with binomial coefficients is considered. This identity generates linear forms in the values of consecutive zeta constants generalizing the number-theoretic Apery-Beukers approach, which gives a chance to acquire novel algorithms for effectively evaluating of the Riemann zeta function at the integer ...
openaire   +1 more source

Fast computation of binomial coefficients

Numerical Algorithms, 2020
One problem that arises in computation involving large numbers is precision. In certain situations, the result might be represented by the standard data type, but arithmetic precision might be compromised when dealing with large numbers in the course to the result. Binomial coefficients are an example that suffer from this torment. In the present paper,
Leonardo Carneiro de Araújo, João Pedro H. Sansão, Adriano S. Vale-Cardoso   +2 more
openaire   +1 more source

On the scarcity of powerful binomial coefficients

Mathematika, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A Regular Determinant of Binomial Coefficients

Proceedings of the American Mathematical Society, 1973
Let n be a positive integer and suppose that each of {a,}' and (c,)} is an increasing sequence of nonnegative integers. Let M be the n x n matrix such that M ij=C(a,, Cj), where C(m, n) is the number of combinations of m objects taken n at a time. We give an explicit formula for the determinant of M as a sum of nonnegative quantities. Further, if ai>cj,
openaire   +2 more sources

The Binomial Coefficient

2015
We now turn our attention to one of the most fundamental and useful notions in all of combinatorics, the binomial coefficient. You may recall the binomial coefficient from high-school algebra class. However, we will give several other interpretations for this concept.
openaire   +1 more source

Binomial coefficient computation

ACM SIGCSE Bulletin, 2002
Binomial coefficient computation, i.e. the calculation of the number of combinations of n objects taken k at a time, C(n,k), can be performed either by using recursion or by iteration. Here, we elaborate on a previous report [6], which presented recursive methods on binomial coefficient calculation and propose alternative efficient iterative methods ...
openaire   +1 more source

Binomial Coefficients, Valuations, and Words

2017
The study of arithmetic properties of binomial coefficients has a rich history. A recurring theme is that p-adic statistics reflect the base-p representations of integers. We discuss many results expressing the number of binomial coefficients \(\left( {\begin{array}{c}n\\ m\end{array}}\right) \) with a given p-adic valuation in terms of the number of ...
openaire   +1 more source

Binomial Confidence Intervals

Journal of the American Statistical Association, 1983
Colin R Blyth
exaly   +2 more sources

Extended binomial AR(1) processes with generalized binomial thinning operator

Communications in Statistics - Theory and Methods, 2020
Dehui Wang, Kai Yang
exaly  

Note on the Binomial Coefficients

Journal of the London Mathematical Society, 1948
openaire   +2 more sources