Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2010 — Part 02 Question 114

Math Olympiad Vault · MathNet 2010 — Part 02

Question 114

Let $P$ be a finite set of prime numbers and be $\ell(P)$ the largest possible number of consecutive natural numbers, so that each of these numbers is divisible by at least one prime number from $P$. Prove the inequality $\ell(P) \geq |P|$ and show that equality applies when the smallest element of $P$ is larger than $|P|$.