Skip to main content
Log in

Number of divisors of the central binomial coefficient

  • Brief Communications
  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

Asymptotic formulas are derived for the following expressions: log τ(C n2n ) and log τ([1, ... , n]).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. P. Erdös and R. L. Graham, “Old and New Problems and Results in Combinatorial Number Theory,” Monogr. Enseign. math. 28 (1980).

  2. A. Sárközy, “On the Divisors of Binomial Coefficients,” J. Number Theory 20, 70 (1985).

    Article  MathSciNet  MATH  Google Scholar 

  3. A. Granville and O Ramaré, “Explicit Bounds on Exponential Sums and the Scarcity of Square-free Binomial Coefficients,” Mathematika 43, 73 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  4. P. Erdös, S. W. Graham, A. Ivić, and C. Pomerance, “On the Divisors of n!,” in Analytic Number Theory: Proc. Gonf. in Honor of Heini Halberstam, Vol. 1, Ed. by B. Berndt, H. Diamond, and A. Hildebrand (Birkhauser, Boston, 1996), pp. 337–355.

    Chapter  Google Scholar 

  5. A. A. Karatsuba, Basic Analytic Number Theory, 2nd ed. (Nauka, Moscow, 1983; Springer, 1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © G.V. Fedorov, 2013, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2013, Vol. 67, No. 4, pp. 34–38.

About this article

Cite this article

Fedorov, G.V. Number of divisors of the central binomial coefficient. Moscow Univ. Math. Bull. 68, 194–197 (2013). https://doi.org/10.3103/S0027132213040050

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132213040050

Keywords

Navigation