Maths Olympiad Prep

Library / HMMT November /265 of 672

HMMT November

Number theory Difficulty 4.9 AIME Find the answer

Let nn be the smallest positive integer with exactly 2015 positive factors. What is the sum of the (not necessarily distinct) prime factors of nn?

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Note that 2015=5×13×312015=5 \times 13 \times 31 and that N=230⋅312⋅54N=2^{30} \cdot 3^{12} \cdot 5^{4} has exactly 2015 positive factors. We claim this is the smallest such integer. Note that N<266N<2^{66}. If nn has 3 distinct prime factors, it must be of the form p30q12r4p^{30} q^{12} r^{4} for some primes p,q,rp, q, r, so n≥230⋅312⋅54n \geq 2^{30} \cdot 3^{12} \cdot 5^{4}. If nn has 2 distinct prime factors, it must be of the form peqf>2e+fp^{e} q^{f}>2^{e+f} where (e+1)(f+1)=2015(e+1)(f+1)=2015. It is easy to see that this means e+f>66e+f>66 so n>266>Nn>2^{66}>N. If nn has only 1 prime factor, we have n≥22014>Nn \geq 2^{2014}>N. So NN is the smallest such integer, and the sum of its prime factors is 2⋅30+3⋅12+5⋅4=1162 \cdot 30+3 \cdot 12+5 \cdot 4=116.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.