Olympiad Maths Prep

Library / /6 of 15

, 2010

Number theory Difficulty 5.4 AIME, harder Prove it Ukraine

Find all natural numbers nn for which among the numbers n,n+1,n+2,,n2n, n+1, n+2, \dots, n^2 there exist 4 pairwise distinct numbers a,b,c,da, b, c, d such that equality ab=cdab = cd holds. Justify the answer.

Solution

Answer: n3n \ge 3.

If 6nn26n \le n^2 or equivalently n6n \ge 6, then after putting a=na = n, c=2nc = 2n, d=3nd = 3n, b=6nb = 6n we will have ab=cdab = cd. So every n6n \ge 6 satisfies the statement.

In the case n=5n = 5 we have numbers 5,6,7,,255, 6, 7, \dots, 25. Considering a=6a = 6, b=20b = 20, c=8c = 8, d=15d = 15 we have the desired result.

In the case n=4n = 4 we have numbers 4,5,6,,164, 5, 6, \dots, 16. Considering a=4a = 4, b=15b = 15, c=6c = 6, d=10d = 10 we have the desired result.

In the case n=3n = 3 we can put a=3a = 3, b=8b = 8, c=4c = 4, d=6d = 6.

In the case n=1,2n = 1, 2 in the set n,n+1,n+2,,n2n, n+1, n+2, \dots, n^2 at most three numbers, so we can't find four pairwise distinct numbers.

Looking for a route rather than 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 and solution reproduced as published; topic and difficulty added by this site.