An explicit generating function arising in counting binomial coefficients divisible by powers of primes

DOI10.4064/aa8524-6-2017zbMath1426.11012arXiv1604.07089OpenAlexW3100857398MaRDI QIDQ4595443

Michael Wallner, Lukas Spiegelhofer

Publication date: 30 November 2017

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.07089

zbMATH Keywords

generating functionsexact enumerationbinomial coefficients modulo powers of primes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Binomial coefficients; factorials; (q)-identities (11B65) Asymptotic enumeration (05A16) Radix representation; digital problems (11A63) Sequences (mod (m)) (11B50)

Related Items (4)

Counting Binomial Coefficients Divisible by a Prime Power ⋮ The Tu-Deng conjecture holds almost surely ⋮ Divisibility of binomial coefficients by powers of two ⋮ A matrix generalization of a theorem of Fine

This page was built for publication: An explicit generating function arising in counting binomial coefficients divisible by powers of primes