Scribd Logo
Importer

Bienvenue sur Scribd !

  • Sylvester - Schur Theorem - Paul Erdös

    Transféré par

    jatinimo1996
    82 vues7 pages

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Formats disponibles

    PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document

    Droits d'auteur :

    Attribution Non-Commercial (BY-NC)
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    82 vues7 pages

    Sylvester - Schur Theorem - Paul Erdös

    Transféré par

    jatinimo1996

    Droits d'auteur :

    Attribution Non-Commercial (BY-NC)
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 7
    A THEOREM OF SYLVESTER AND SCHUR Pav Erpos*. [Extracted from the Journal of the London Mathematical Society, Vol. 9, Part 4.] The theorem in question asserts that, if n > k, then, in the set of integers n, n+], n+2, ...,v-+k—1, there is a number containing a prime divisor greater than &. If n=k+1, we obtain the well-known theorem of Chebyshev. ‘The theorem was first asserted and proved by Sylvester} about forty-five years ago. Recently Schur} has rediscovered and again proved the theorem. The following proof is shorter and more elementary than the previous ones. We shall not use Chebyshev’s results, so that we shall also prove Chebyshev’s theorem§. * Recoived 22 March, 1034; read 20 April, 1934 } J.J. Sylvester, “On arithmetical series”, Messenger of Math, 21 (1802), 1-19, 87-120; and Collected mathematical papers, 4 (1912), 687-731. t J. Schur, “ Einige Satze dber Primzahien mit Anwendung auf Irreduzibilitatefragen ” Siteungeberichte der prewssiechen Akademie der Wissenachaften, Phyo. Math. Klasse, 23 (1020), 1-24. § P. Erdds, “Beweis eines Satzes von Tschebyschef”, Acta Lit. ac Sci. Regiae Universitatis Hungarieae Fransciseo-Josephinae, 5 (1932), 194-198. 283 P. Erpés We first express the theorem in the following form: Ifn > 2k, then (z) contains a prime divisor greater than k. We shall prove first the following lemma : i (f) is divisible by a power of a prime p*, then p" -8, +(k) <}k. Hence, if (3) had no prime factors greater than &, we should have, from the lemma, @ 2, there is always a prime number between y/n and 2. A THEOREM OF SYLVESTER AND ScHUR. 284 Since x(k) < 3k for k>37* (we see the validity of this proposition by considering the number of integers less than k and not divisible by 2, 3, and 3) we can prove the theorem, just as in § 1, for s7 nt. We suppose that b> 37. If (71) contains no prime divisor exceeding f. then GB ek ah ee This inequality is an immediate consequence of the Jemma about the prime power divisors of (i): First we shall prove+ that “> 1p Top, Wp PM VN BR (1) For this purpose, we analyse the prime factors of the binomial coefficient 2n) _. 2a)! (a) = Ge This evident that (77 ") contains every prime p such that n

    Vous aimerez peut-être aussi