An alternative proof of Sylvester's theorem and variations for more primes

Abstract

This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger versions of Sylvester's theorem and Bertrand's postulate with more primes, as well as an approach to get more results in this direction.

arXiv comment8 pages