Maths Olympiad Prep

Library / /1 of 4

Number theory Difficulty 4.7 AIME Prove it Italy

Problem:

We say that a natural number is balanced if it is written with as many digits as it has distinct prime divisors (for example, 1515 is balanced, while 4949 is not).
Prove that there are only finitely many balanced numbers.

Solution

Solution:

There are no balanced numbers with cc digits if c>100c > 100. Indeed, such a number would be the product of cc primes, at least half of which are greater than 100100. Hence the number would be greater than 100c/2=10c100^{c / 2} = 10^{c}, which is absurd. In fact the largest balanced number has exactly ten digits, since 2357111317192329<10102 \cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 \cdot 29 < 10^{10}, while 235711131719232931>10112 \cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31 > 10^{11}.

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.