1990 AIME Problem 5

Attempt Problem 5 of the 1990 AIME below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 1990 AIME solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

5.

Let nn be the smallest positive integer that is a multiple of 7575 and has exactly 7575 positive integral divisors, including 11 and itself. Find n75.\frac{n}{75}.

Answer: 432
Concepts:factor countingprime factorizationoptimization
Difficulty rating: 2100
Small Hint:

Factor 7575 into possible products of numbers one greater than prime exponents

Big Hint:

The exponent pattern (4,4,2)(4,4,2) can include the required factors 33 and 525^2 while assigning the largest exponents to the smallest primes

Solution:

The multiplicative partitions of 7575 give exponent patterns (74),(74), (24,2),(24,2), (14,4),(14,4), and (4,4,2).(4,4,2). A number divisible by 75=35275=3\cdot5^2 needs both primes 33 and 5,5, so the one-prime pattern is impossible. The smallest candidates from the two-prime patterns are 324523^{24}5^2 and 31454,3^{14}5^4, respectively. The smallest three-prime candidate is n=243452.n=2^4\cdot3^4\cdot5^2. It has (4+1)(4+1)(2+1)=75(4+1)(4+1)(2+1)=75 divisors, and each two-prime candidate is larger because 32452n=32016>1 \frac{3^{24}5^2}{n}=\frac{3^{20}}{16}\gt1 and 31454n=3105216>1. \frac{3^{14}5^4}{n}=\frac{3^{10}5^2}{16}\gt1. Therefore n75=243452352=2433=432.\frac n{75}=\frac{2^4\cdot3^4\cdot5^2}{3\cdot5^2}=2^4\cdot3^3=432.

← Problem 4#4
Full Exam

Problem 5 in Other Years