Generalizations of a theorem about the binomial coefficient
From MaRDI portal
Abstract: The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].
Recommendations
- scientific article; zbMATH DE number 1391714
- The generalization of the binomial theorem
- A generalization of the binomial coefficients
- On a generalization of binomial coefficients
- scientific article; zbMATH DE number 6462197
- A new generalization of binomial coefficients
- scientific article; zbMATH DE number 5039793
- scientific article; zbMATH DE number 3929011
- A generalized binomial theorem and a summation formulae
- scientific article; zbMATH DE number 2145141
Cited in
(8)- On a generalization of binomial coefficients
- On the conditioned binomial coefficients.
- A generalized binomial theorem for induced weak compositions
- Binomial coefficients in arithmetic progressions
- scientific article; zbMATH DE number 2234896 (Why is no real title available?)
- Analogues of the binomial coefficient theorems of Gauss and Jacobi
- A refinement of the function \(g(x)\) on Grimm's conjecture
- The generalization of the binomial theorem
This page was built for publication: Generalizations of a theorem about the binomial coefficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651402)