
Summary: In this paper we establish a series of identities for sums of binomial coefficients to prove their divisibility by prime \(n\). These sums arise from exponents of commutators in collection formula for \((xy)^n\) with some restrictions on variables of the commutators.
собирательные формулы, делимость, Binomial coefficients; factorials; \(q\)-identities, divisibility, sums of binomial coefficients, суммы биномиальных коэффициентов, collection formulas, Factorials, binomial coefficients, combinatorial functions
собирательные формулы, делимость, Binomial coefficients; factorials; \(q\)-identities, divisibility, sums of binomial coefficients, суммы биномиальных коэффициентов, collection formulas, Factorials, binomial coefficients, combinatorial functions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
