Maths Olympiad Prep

Library / /398 of 520

Number theory Difficulty 6.5 National olympiad Find the answer

4. (1) Find all positive integers nn, such that there exist a,bNa, b \in \mathbf{N}^{*}, satisfying: [a,b]=n![a, b]=n!, (a,b)=1998;(a, b)=1998 ;
(2) Under the condition that (1) holds, to ensure that the number of pairs of positive integers (a,b)(a, b) with aba \leqslant b does not exceed 1998, what condition should nn satisfy?

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

4. (1) From (a,b)=2×33×37(a, b)=2 \times 3^{3} \times 37, we know 37[a,b]37 \mid[a, b], which means 37n37 \mid n, so n37n \geqslant 37. When n37n \geqslant 37, 1998n!1998 \mid n!, at this time, taking a=1998,b=n!a=1998, b=n! will suffice. Therefore, the positive integers nn that satisfy the condition are all positive integers not less than 37.
(2) Let a=1998x,b=1998ya=1998 x, b=1998 y, then (x,y)=1(x, y)=1. When n37n \geqslant 37, we have xy=233×314×58×75×113×132×172×19×23×29×31×(n!37!)x y=2^{33} \times 3^{14} \times 5^{8} \times 7^{5} \times 11^{3} \times 13^{2} \times 17^{2} \times 19 \times 23 \times 29 \times 31 \times\left(\frac{n!}{37!}\right).

Thus, when 37n4037 \leqslant n \leqslant 40, the number of pairs (x,y)(x, y) is 12×211=1024\frac{1}{2} \times 2^{11}=1024 pairs, and when n41n \geqslant 41, there are at least 12×212=2048\frac{1}{2} \times 2^{12}=2048 pairs, hence 37n4037 \leqslant n \leqslant 40.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.