Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

On the prime factors of $(^{2n}_{n})$
HTML articles powered by AMS MathViewer

by P. Erdős, R. L. Graham, I. Z. Ruzsa and E. G. Straus PDF
Math. Comp. 29 (1975), 83-92 Request permission

Abstract:

Several quantitative results are given expressing the fact that $(_n^{2n})$ is usually divisible by a high power of the small primes. On the other hand, it is shown that for any two primes p and q, there exist infinitely many n for which $((_n^{2n}),pq) = 1$.
References
    H. BALAKRAN, "On the values of n which make $(2n)!/(n + 1)!(n + 1)!$ an integer," J. Indian Math. Soc., v. 18, 1929, pp. 97-100.
  • P. Erdős, On some divisibility properties of ${2n\choose n}$, Canad. Math. Bull. 7 (1964), 513–518. MR 169809, DOI 10.4153/CMB-1964-047-5
    • P. ERDÖS, "Aufgabe 557," Elemente Math., v. 23, 1968, pp. 111-113.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 10H15, 10L10
  • Retrieve articles in all journals with MSC: 10H15, 10L10
Additional Information
  • © Copyright 1975 American Mathematical Society
  • Journal: Math. Comp. 29 (1975), 83-92
  • MSC: Primary 10H15; Secondary 10L10
  • DOI: https://doi.org/10.1090/S0025-5718-1975-0369288-3
  • MathSciNet review: 0369288