Counting binomial coefficients divisible by a prime power
From MaRDI portal
Publication:4575985
Recommendations
- Number of binomial coefficients divisible by a fixed power of a prime
- scientific article; zbMATH DE number 613254
- The number of nonzero binomial coefficients modulo \(p^{\alpha}\)
- scientific article; zbMATH DE number 1182961
- Subprime factorization and the numbers of binomial coefficients exactly divided by powers of a prime
Cites work
- scientific article; zbMATH DE number 1114507 (Why is no real title available?)
- scientific article; zbMATH DE number 3805454 (Why is no real title available?)
- scientific article; zbMATH DE number 2124078 (Why is no real title available?)
- scientific article; zbMATH DE number 4187932 (Why is no real title available?)
- An explicit generating function arising in counting binomial coefficients divisible by powers of primes
- Binomial Coefficients Modulo a Prime
- Dominance orders, generalized binomial coefficients, and Kummer's theorem
- Number of binomial coefficients divisible by a fixed power of a prime
- Recounting the Rationals
- Subprime factorization and the numbers of binomial coefficients exactly divided by powers of a prime
- The number of binomial coefficients divisible by a fixed power of a prime
- The number of nonzero binomial coefficients modulo \(p^{\alpha}\)
Cited in
(6)- Number of binomial coefficients divisible by a fixed power of a prime
- Some combinatorics from Zeckendorf representations
- Some combinatorics of factorial base representations
- The number of nonzero binomial coefficients modulo \(p^{\alpha}\)
- \(p\)-adic order of positive integers via binomial coefficients
- The power of a prime that divides a generalized binomial coefficient.
This page was built for publication: Counting binomial coefficients divisible by a prime power
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575985)