Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-24T19:37:30.568Z Has data issue: false hasContentIssue false

On a Theorem of Sylvester and Schur

Published online by Cambridge University Press:  20 November 2018

D. Hanson*
Affiliation:
University of Saskatchewan, Regina, Saskatchewan
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In 1892, Sylvester [7] proved that in the set of integers n, n+l,…, n+k—1, n> k > 1, there is a number containing a prime divisor greater than k. This theorem was rediscovered, in 1929, by Schur [6]. More recent results include an elementary proof by Erdös [1] and a proof of the following theorem by Faulkner [2]: Let pk be the least prime ≥2k; if n≥pk then has a prime divisor ≥pk with the exceptions and In that paper the author uses some deep results of Rosser and Schoenfeld [5] on the distribution of primes.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1973

References

1. Erdös, P., A theorem of Sylvester and Schur, J. London Math. Soc. 9 (1934), 282288.Google Scholar
2. Faulkner, M., On a theorem of Sylvester and Schur, J. London Math. Soc. 41 (1966), 107110.Google Scholar
3. Hanson, D., On the product of the primes, Canad. Math. Bull., (1) 15 (1972), 3337.Google Scholar
4. Moser, L., Insolvability of , Canad. Math. Bull. (2) 6 (1963), 167169.Google Scholar
5. Rosser, J.B. and Schoenfeld, L., Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 6494.Google Scholar
6. Schur, I., Einige Satze uber Primzahlen mit wendung auf Irreduzibilitatsfragen, Sitzungberichte der preussichen Akedemie der Wissenschaften, Phys. Math. Klasse, 23 (1929), 124.Google Scholar
7. Sylvester, J.J., On arithmetical series, Messenger of Mathematics, XXI (1892), 1–19, 87–120, and Mathematical Papers, 4 (1912), 687731.Google Scholar