On a Theorem of Sylvester and Schur
Canadian mathematical bulletin, Tome 16 (1973) no. 2, pp. 195-199

Voir la notice de l'article provenant de la source Cambridge

DOI

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.
Hanson, D. On a Theorem of Sylvester and Schur. Canadian mathematical bulletin, Tome 16 (1973) no. 2, pp. 195-199. doi: 10.4153/CMB-1973-035-3
@article{10_4153_CMB_1973_035_3,
     author = {Hanson, D.},
     title = {On a {Theorem} of {Sylvester} and {Schur}},
     journal = {Canadian mathematical bulletin},
     pages = {195--199},
     year = {1973},
     volume = {16},
     number = {2},
     doi = {10.4153/CMB-1973-035-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-035-3/}
}
TY  - JOUR
AU  - Hanson, D.
TI  - On a Theorem of Sylvester and Schur
JO  - Canadian mathematical bulletin
PY  - 1973
SP  - 195
EP  - 199
VL  - 16
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-035-3/
DO  - 10.4153/CMB-1973-035-3
ID  - 10_4153_CMB_1973_035_3
ER  - 
%0 Journal Article
%A Hanson, D.
%T On a Theorem of Sylvester and Schur
%J Canadian mathematical bulletin
%D 1973
%P 195-199
%V 16
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-035-3/
%R 10.4153/CMB-1973-035-3
%F 10_4153_CMB_1973_035_3

Cité par Sources :