Counting binomial coefficients divisible by a prime power
DOI10.1080/00029890.2018.1449523zbMATH Open1390.05024DBLPjournals/tamm/CastroDEJKS18OpenAlexW2803691282WikidataQ58122678 ScholiaQ58122678MaRDI QIDQ4575985FDOQ4575985
Tom Edgar, Devon M. Johnson, Desiree Domini, Philip J. de Castro, Steven Klee, Ranjani Sundaresan
Publication date: 11 July 2018
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00029890.2018.1449523
Recommendations
Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Binomial coefficients; factorials; (q)-identities (11B65) Elementary theory of partitions (11P81)
Cites Work
- Title not available (Why is that?)
- Binomial Coefficients Modulo a Prime
- Title not available (Why is that?)
- Number of binomial coefficients divisible by a fixed power of a prime
- Recounting the Rationals
- Title not available (Why is that?)
- An explicit generating function arising in counting binomial coefficients divisible by powers of primes
- Title not available (Why is that?)
- The number of binomial coefficients divisible by a fixed power of a prime
- Subprime factorization and the numbers of binomial coefficients exactly divided by powers of a prime
- The number of nonzero binomial coefficients modulo \(p^{\alpha}\)
- Dominance Orders, Generalized Binomial Coefficients, and Kummer's Theorem
Cited In (4)
Uses Software
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)
