On a function related of multinomial coefficients. I.
From MaRDI portal
Publication:1565979
DOI10.1007/s10114-002-0212-8zbMath1042.11009OpenAlexW2001184724MaRDI QIDQ1565979
Publication date: 25 September 2003
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-002-0212-8
Binomial coefficients; factorials; (q)-identities (11B65) Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distribution of polynomial coefficients, congruent modulo \(p^ N\)
- A summation formula related to the binary digits
- Reducing multinomial coefficients modulo a prime power
- Exponential sums of sum-of-digit functions
- On the number of odd binomial coefficients
- The number of multinomial coefficients divisible by a fixed power of a prime
- Pascal's triangle (mod 9)
- On Binomial Coefficient Residues
- The number of binomial coefficients in residue classes modulo p and $p^2$.
- Exponential Sums Related to Binomial Coefficient Parity
- The Number of 1’s in Binary Integers: Bounds and Extremal Properties
- Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence†
- Notes on Binomial Coefficients Ii-The Least N such that pe Divides an r -Nomial Coefficient of Rank n †
- Notes on Binomial Coefficients Iii-Any Integer Divides Almost All Binomial Coefficients†
- Number of Odd Binomial Coefficients
- Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity
- Asymptotic behavior of Pascal's triangle modulo a prime
- The Number of Binomial Coefficients Divisible by a Fixed Power of 2
- Formulas for the Number of Binomial Coefficients Divisible by a Fixed Power of a Prime
- Binomial Coefficients Modulo a Prime
This page was built for publication: On a function related of multinomial coefficients. I.
