Maths Olympiad Prep

Library / /44 of 71

Number theory Difficulty 5.2 AIME, harder Prove it United States

Problem:

Let NN be a three-digit integer such that the difference between any two positive integer factors of NN is divisible by 33. Let d(N)d(N) denote the number of positive integers which divide NN. Find the maximum possible value of Nd(N)N \cdot d(N).

Solution

Solution:

We first note that all the prime factors of nn must be 11 modulo 33 (and thus 11 modulo 66). The smallest primes with this property are 7,13,19,7, 13, 19, \ldots. Since 74=2401>10007^{4} = 2401 > 1000, the number can have at most 33 prime factors (including repeats). Since 71319=1729>10007 \cdot 13 \cdot 19 = 1729 > 1000, the most factors NN can have is 66.

Consider the number 7219=9317^{2} \cdot 19 = 931, which has 66 factors. For this choice of NN, Nd(N)=5586N \cdot d(N) = 5586.

For another NN to do better, it must have at least 66 factors, for otherwise, Nd(N)<10005=5000N \cdot d(N) < 1000 \cdot 5 = 5000. It is easy to verify that 72197^{2} \cdot 19 is the greatest number with 66 prime factors satisfying our conditions, so the answer must be 55865586.

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.