Maths Olympiad Prep

Track / Stage 4 / 336 of 340 #1076 of 2444

Problem 1076

AMC 12 late, AIME early
Number theory Difficulty 5.0 Find the answer HMMT February

Compute the number of positive integers that divide at least two of the integers in the set {11,22,33,44,55,66,77,88,99,1010}\{1^{1}, 2^{2}, 3^{3}, 4^{4}, 5^{5}, 6^{6}, 7^{7}, 8^{8}, 9^{9}, 10^{10}\}.

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

Next problem →

Official solution

For a positive integer nn, let rad\operatorname{rad} n be the product of the distinct prime factors of nn. Observe that if nmmn \mid m^{m}, all prime factors of nn must divide mm, so radn\operatorname{rad} n \mid m. Therefore, if nn is such an integer, rad\operatorname{rad} n must divide at least two of the numbers in {1,2,3,4,5,6,7,8,9,10}\{1,2,3,4,5,6,7,8,9,10\}, implying that rad nn is either 1,2,31,2,3, or 5. These have 1,10,61,10,6, and 5 cases, respectively, for a total of 22.

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