Maths Olympiad Prep

Library / /63 of 71

Number theory Difficulty 5.7 AIME, harder Prove it United States

Problem:

The rank of a rational number qq is the unique kk for which q=1a1++1akq = \frac{1}{a_{1}} + \cdots + \frac{1}{a_{k}}, where each aia_{i} is the smallest positive integer such that q1a1++1aiq \geq \frac{1}{a_{1}} + \cdots + \frac{1}{a_{i}}. Let qq be the largest rational number less than 14\frac{1}{4} with rank 33, and suppose the expression for qq is 1a1+1a2+1a3\frac{1}{a_{1}} + \frac{1}{a_{2}} + \frac{1}{a_{3}}. Find the ordered triple (a1,a2,a3)\left(a_{1}, a_{2}, a_{3}\right).

Solution

Solution:

Answer: (5,21,421)(5,21,421)

Suppose that AA and BB were rational numbers of rank 33 less than 14\frac{1}{4}, and let a1,a2,a3,b1,b2,b3a_{1}, a_{2}, a_{3}, b_{1}, b_{2}, b_{3} be positive integers so that A=1a1+1a2+1a3A = \frac{1}{a_{1}} + \frac{1}{a_{2}} + \frac{1}{a_{3}} and B=1b1+1b2+1b3B = \frac{1}{b_{1}} + \frac{1}{b_{2}} + \frac{1}{b_{3}} are the expressions for AA and BB as stated in the problem. If b1<a1b_{1} < a_{1} then A<1a111b1<BA < \frac{1}{a_{1}-1} \leq \frac{1}{b_{1}} < B. In other words, of all the rationals less than 14\frac{1}{4} with rank 33, those that have a1=5a_{1} = 5 are greater than those that have a1=6,7,8,a_{1} = 6,7,8, \ldots

Therefore we can "build" qq greedily, adding the largest unit fraction that keeps qq less than 14\frac{1}{4}:

15\frac{1}{5} is the largest unit fraction less than 14\frac{1}{4}, hence a1=5a_{1} = 5;

121\frac{1}{21} is the largest unit fraction less than 1415\frac{1}{4} - \frac{1}{5}, hence a2=21a_{2} = 21;

1421\frac{1}{421} is the largest unit fraction less than 1415121\frac{1}{4} - \frac{1}{5} - \frac{1}{21}, hence a3=421a_{3} = 421.

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.