Skip to main content
Log in

Über die Anzahl der Primfaktoren von\(\left( {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right)\)

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

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.

Literaturverzeichnis

  1. P. Erdös, Beweis eines Satzes von Tchebischeff. Acta Sci. Math. (Szeged)5, 194–198 (1932).

    Google Scholar 

  2. P. Erdös, A theorem of Sylvester and Schur. J. London Math. Soc.9, 282–288 (1934).

    Google Scholar 

  3. P. Erdös, On consecutive integers. Nieuw Arch. Wisk.3, 124–128 (1955).

    Google Scholar 

  4. P.Erdös and J.Selfridge, Some problems on the prime factors of consecutive integers, II. Pullman conference on number theory 1971.

  5. F. Hering, Eine Beziehung zwischen Binomialkoeffizienten und Primzahlpotenzen. Arch. Math.19, 411–412 (1968).

    Google Scholar 

  6. H. Scheid, Die Anzahl der Primfaktoren in\(\left( {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right)\). Arch. Math.20, 581–582 (1969).

    Google Scholar 

  7. A. Schinzel etW. Sierpinski, Sur certaines hypothèses concernant les nombres premiers. Acta Arith.4, 185–208 (1958).

    Google Scholar 

  8. W. Stahl, Bemerkung zu einer Arbeit von Hering. Arch. Math.20, 580 (1969).

    Google Scholar 

  9. P. Turán, On a theorem of Hardy and Ramanujan. J. London Math. Soc.9, 274–276 (1934).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erdös, P. Über die Anzahl der Primfaktoren von\(\left( {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right)\) . Arch. Math 24, 53–56 (1973). https://doi.org/10.1007/BF01228172

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01228172

Navigation