Maths Olympiad Prep

Library / /19 of 45

, 2008

Algebra Difficulty 5.5 AIME, harder Prove it Slovenia

For what positive integers n>1n > 1 does the expression
log102log103log10n10n1 \frac{\log_{10} 2 \cdot \log_{10} 3 \cdots \log_{10} n}{10^{n-1}}
attain the smallest possible value? Find this value.

Solution

Let us compare the expressions log102log103log10(n1)10n2\frac{\log_{10} 2 \log_{10} 3 \cdots \log_{10} (n-1)}{10^{n-2}} and log102log103log10n10n1\frac{\log_{10} 2 \log_{10} 3 \cdots \log_{10} n}{10^{n-1}}. The inequality
log102log103log10(n1)10n2log102log103log10n10n1 \frac{\log_{10} 2 \log_{10} 3 \cdots \log_{10} (n-1)}{10^{n-2}} \ge \frac{\log_{10} 2 \log_{10} 3 \cdots \log_{10} n}{10^{n-1}}
holds if and only if 1110log10n=log10n101 \ge \frac{1}{10} \log_{10} n = \log_{10} \sqrt[10]{n}, which is equivalent to 10n1010 \ge \sqrt[10]{n} and 1010n10^{10} \ge n. This implies
log10210>log102log103102>>log102log103log10(10101)1010102=log102log103log10(1010)1010101 \begin{aligned} \frac{\log_{10} 2}{10} &> \frac{\log_{10} 2 \cdot \log_{10} 3}{10^2} > \dots > \frac{\log_{10} 2 \cdot \log_{10} 3 \cdots \log_{10} (10^{10} - 1)}{10^{10^{10}-2}} \\ &= \frac{\log_{10} 2 \cdot \log_{10} 3 \cdots \log_{10} (10^{10})}{10^{10^{10}-1}} \end{aligned}
and
log102log103log10(1010)1010101<log102log103log10(1010+1)101010<log102log103log10(1010+2)101010+1< \begin{aligned} \frac{\log_{10} 2 \cdot \log_{10} 3 \cdots \log_{10} (10^{10})}{10^{10^{10}-1}} < & \frac{\log_{10} 2 \cdot \log_{10} 3 \cdots \log_{10} (10^{10} + 1)}{10^{10^{10}}} \\ < & \frac{\log_{10} 2 \cdot \log_{10} 3 \cdots \log_{10} (10^{10} + 2)}{10^{10^{10}+1}} < \dots \end{aligned}
So, the expression log102log103log10n10n1\frac{\log_{10} 2 \log_{10} 3 \cdots \log_{10} n}{10^{n-1}} has the smallest possible value when n=10101n = 10^{10} - 1 or n=1010n = 10^{10}. For these two values of nn the value of the expression is
log102log103log1010101010101 \frac{\log_{10} 2 \log_{10} 3 \cdots \log_{10} 10^{10}}{10^{10^{10}-1}}

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.