On Prime Divisors of Binomial Coefficients

DOI10.2307/2008595zbMath0673.10012OpenAlexW4256170887MaRDI QIDQ3826635

Pierre Goetgheluck

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2008595

zbMATH Keywords

number of prime factorscomputational number theorydivisibility of binomial coefficientsErdős's asymptotic formula

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (5)

Fractals related to Pascal's triangle ⋮ Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes ⋮ The Bernstein polynomial basis: a centennial retrospective ⋮ Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients ⋮ Infinite families of solutions of the equation \binom{𝑛}𝑘=2\binom{𝑎}𝑏

This page was built for publication: On Prime Divisors of Binomial Coefficients