MathDB
INMO 2019 P4

Source:

January 20, 2019

Problem Statement

Let nn and MM be positive integers such that M>nn1M>n^{n-1}. Prove that there are nn distinct primes p1,p2,p3,pnp_1,p_2,p_3 \cdots ,p_n such that pjp_j divides M+jM + j for all 1jn1 \le j \le n.