Maths Olympiad Prep

Library / /2 of 5

, 2024

Number theory Difficulty 6.5 National olympiad Prove it Czech-Polish-Slovak Mathematical Match

Determine whether there exist 20242024 distinct positive integers satisfying the following: If we consider every possible ratio between two distinct numbers (we include both a/ba/b and b/ab/a), we will obtain numbers with finite decimal expansions (after the decimal point) of mutually distinct non-zero lengths. (Patrik Bak, Slovakia)

Solution

We will show these numbers exist. For that we define sequences a1,a2,,a2024a_1, a_2, \dots, a_{2024} and b1,b2,,b2024b_1, b_2, \dots, b_{2024} and then consider numbers ci=2ai5bic_i = 2^{a_i} \cdot 5^{b_i} for i=1,2,,2024i = 1, 2, \dots, 2024.
We choose the sequences aia_i and bib_i in such a way that aia_i is increasing, bib_i is decreasing, and the differences aiaja_i - a_j and bjbib_j - b_i were all mutually distinct for all indices i>ji > j. This will be enough because
cicj=2ai5bi2aj5bj=2aiaj5bjbi, \frac{c_i}{c_j} = \frac{2^{a_i} \cdot 5^{b_i}}{2^{a_j} \cdot 5^{b_j}} = \frac{2^{a_i - a_j}}{5^{b_j - b_i}},
this number has a decimal expansion of a length bjbib_j - b_i, whereas analogously, cjci\frac{c_j}{c_i} has a length of aiaja_i - a_j.

We now construct the needed sequences, starting with aia_i. We will do it inductively. Take a1=1,a2=2a_1 = 1, a_2 = 2. When we have the numbers a1,a2,,aia_1, a_2, \dots, a_i, then by choosing ai+1=2aia_{i+1} = 2a_i we will achieve ai+1ai>aia1a_{i+1} - a_i > a_i - a_1, therefore all newly added differences will be higher than the previous ones.

We can construct bib_i similarly, starting at the end by taking b2024=a2024b_{2024} = a_{2024}, then b2023=2b2024b_{2023} = 2b_{2024}, and so on. Since b2023b2024=a2024b_{2023} - b_{2024} = a_{2024}, all the differences in bib_i will be at least b2023b2024=a2024b_{2023} - b_{2024} = a_{2024}.

Remark: In our construction, ai=2i1a_i = 2^{i-1} and bi=24049ib_i = 2^{4049-i}.

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 and solution reproduced as published; topic and difficulty added by this site.