Vol. 29, No. 2, 1969

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 294: 1
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
On prime divisors of the binomial coefficient

Earl F. Ecklund Jr.

Vol. 29 (1969), No. 2, 267–270
Abstract

A classical theorem discovered independently by J. Sylvester and I. Schur states that in a set of k consecutive integers, each of which is greater than k, there is a number having a prime divisor greater than k. In giving an elementary proof, P. Erdös expressed the theorem in the following form:

If n 2k, then (n)
k has a prime divisor p > k.

Recently, P. Erdös suggested a problem of a complementary nature:

If n 2k, then (n)
k has a prime divisor p n∕2

The problem is solved by the following

Theorem. If n 2k, then (n)
k has a prime divisor p max{n
k,n
2}, with the exception (7)
3.

Mathematical Subject Classification
Primary: 10.08
Milestones
Received: 8 July 1968
Published: 1 May 1969
Authors
Earl F. Ecklund Jr.