Maths Olympiad Prep

Library / /62 of 121

Number theory Difficulty 6.0 National Olympiad Prove it India

Problem:

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}, \ldots, p_{n} such that pjp_{j} divides M+jM + j for 1jn1 \leq j \leq n.

Solution

Solution:

If some number M+kM + k, 1kn1 \leq k \leq n, has at least nn distinct prime factors, then we can associate a prime factor of M+kM + k with the number M+kM + k which is not associated with any of the remaining n1n - 1 numbers.

Suppose M+jM + j has less than nn distinct prime factors. Write
M+j=p1α1p2α2prαr,r<n M + j = p_{1}^{\alpha_{1}} p_{2}^{\alpha_{2}} \cdots p_{r}^{\alpha_{r}}, \quad r < n
But M+j>nn1M + j > n^{n-1}. Hence there exist tt, 1tr1 \leq t \leq r such that ptαt>np_{t}^{\alpha_{t}} > n. Associate ptp_{t} with this M+jM + j. Suppose ptp_{t} is associated with some M+lM + l. Let ptβtp_{t}^{\beta_{t}} be the largest power of ptp_{t} dividing M+lM + l. Then ptβt>np_{t}^{\beta_{t}} > n. Let T=gcd(ptαt,ptβt)T = \operatorname{gcd}\left(p_{t}^{\alpha_{t}}, p_{t}^{\beta_{t}}\right). Then T>nT > n. Since T(M+j)T \mid (M + j) and T(M+l)T \mid (M + l), it follows that T(jl)T \mid (|j - l|). But jl<n|j - l| < n and T>nT > n, and we get a contradiction. This shows that ptp_{t} cannot be associated with any other M+lM + l. Thus each M+jM + j is associated with different primes.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.