Maths Olympiad Prep

Library / /23 of 75

Algebra Difficulty 4.6 AIME Prove it Italy

Problem:

How many triples of integers (a,b,c)(a, b, c), all greater than 11, are there such that abc<2002a^{b^{c}} < 2002?

Solution

Solution:

We distinguish 2 cases:

- if a=2a=2 we must have bc<11b^{c}<11 because 211=2048>20022^{11}=2048>2002, so b<4b<4 and if b=2b=2 then cc can be 22 or 33, while if b=3b=3 then c=2c=2: thus we obtain the solutions (2,2,2)(2,2,2), (2,2,3)(2,2,3), (2,3,2)(2,3,2);

- if a>2a>2 we must have bc<7b^{c}<7 because a737=2187>2002a^{7} \geq 3^{7}=2187>2002. Therefore the only possibility is to have b=2b=2 and c=2c=2. Since 64=1296<20026^{4}=1296<2002 while 74=2401>20027^{4}=2401>2002, the admissible values are a=3,4,5,6a=3,4,5,6 which give the solutions (3,2,2)(3,2,2), (4,2,2)(4,2,2), (5,2,2)(5,2,2), (6,2,2)(6,2,2) for a total of 77 solutions.

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 translated into English from it; metadata (topic, difficulty) added by this project.