On the order of prime powers dividing \({2n\choose n}\)

DOI10.1007/BF02392802zbMath0821.11007OpenAlexW2041864045MaRDI QIDQ1346035

Jürgen Sander

Publication date: 17 April 1995

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

Full work available at URL: https://doi.org/10.1007/bf02392802

zbMATH Keywords

lower boundbinomial coefficientsmaximal multiplicity of prime factorsVinogradov's method of exponential sums

Mathematics Subject Classification ID

Binomial coefficients; factorials; (q)-identities (11B65)

Related Items (1)

Erdős and the integers

Cites Work

• On divisors of binomial coefficients. I
• Prime power divisors of binomial coefficients.
• An asymptotic formula for a ‐th powers dividing binomial coefficients
• Unsolved problems in number theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the order of prime powers dividing \({2n\choose n}\)